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

Files
Statistics
Metrics and citations
 
Share
Export
EndNoteBibTexRIS
Metadata
Show full item record
Author/s
Cabrera Revuelta, ElenaAuthority UCA; Chávez, María-José; Márquez Pérez, Alberto
Date
2018-07
Department
Ingeniería Mecánica y Diseño Industrial
Source
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.
Abstract
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.
Subjects
art gallery theorem; fortress problem; laser scanner
Collections
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
This work is under a Creative Commons License Attribution-NonCommercial-NoDerivatives 4.0 Internacional