HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Stabbing information of a simple polygon

Hazel Everett 1 Ferran Hurtado 2 Marc Noy 2
1 ISA - Models, algorithms and geometry for computer graphics and vision
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : The purpose of this paper is to investigate a new combinatorial object describing the structure of a simple polygon and compare it to other well-known objects such as the internal and external visibility graphs, the convex hull and the order type of the vertex set. We call the new object the stabbing information. In fact, we define three variations of the stabbing information, strong, weak and labelled, and explore the relationships among them. The main result of the paper is that strong stabbing information is sufficient to recover the convex hull, the internal and external visibility graphs and to determine which vertices are reflex and it is not sufficient to recover the order type of the vertex set. We also show that the labelled stabbing information is equivalent to the order type. We give algorithms for computing each of these new structures.
Document type :
Journal articles
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:39:13 AM
Last modification on : Friday, February 4, 2022 - 3:30:28 AM


  • HAL Id : inria-00098848, version 1



Hazel Everett, Ferran Hurtado, Marc Noy. Stabbing information of a simple polygon. Discrete Applied Mathematics, Elsevier, 1999, 91 (1-3), pp.67-92. ⟨inria-00098848⟩



Record views