The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application
From MaRDI portal
Publication:1792091
DOI10.1016/j.endm.2018.06.030zbMath1434.68600OpenAlexW2884644292WikidataQ129501107 ScholiaQ129501107MaRDI QIDQ1792091
Alberto Márquez Pérez, Elena Cabrera Revuelta, María José Chávez de Diego
Publication date: 11 October 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.06.030
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Unnamed Item
- Unnamed Item
- The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
- A combinatorial theorem in plane geometry
- Edge guards for the fortress problem
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- Guarding Exterior Region of a Simple Polygon
This page was built for publication: The fortress problem in terms of the number of reflex and convex vertices. A 3D objects scanning application