The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application
Identificadores
URI: http://hdl.handle.net/10498/31567
DOI: 10.1016/j.endm.2018.06.030
ISSN: 1571-0653
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2018-07Departamento/s
Ingeniería Mecánica y Diseño IndustrialFuente
E. Cabrera Revuelta, M. J. Chávez de Diego, and A. Márquez Pérez, “The Fortress Problem in Terms of the Number of Reflex and Convex Vertices. A 3D objects scanning application,” Electron. Notes Discret. Math., vol. 68, 2018, doi: 10.1016/j.endm.2018.06.030.Resumen
This work focuses on the visibility of exterior of a polygon. We show a lower bound for the Fortress Problem applied to polygons P having n vertices in terms of the number of reflex vertices, the number of convex vertices and the number of pockets that are found when the convex hull is made on P. The results are related to the task of the geometric data acquisition for architectural surveys through techniques such as laser scanner.
Materias
art gallery theorem; fortress problem; laser scannerColecciones
- Artículos Científicos [12034]
- Articulos Científicos Ing. Mec. [327]






