Stabbing information of a simple polygon

DOI10.1016/S0166-218X(98)00144-9zbMath0972.52006WikidataQ127593015 ScholiaQ127593015MaRDI QIDQ1283786

Marc Noy, Hazel Everett, Ferran Hurtado

Publication date: 30 March 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmssimple polygonstabbing information

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37)

Related Items

Orthogonal polygon reconstruction from stabbing information

Cites Work

• Unnamed Item
• Unnamed Item
• The power of geometric duality
• On-line construction of the convex hull of a simple polyline
• An optimal visibility graph algorithm for triangulated simple polygons
• Triangulating a simple polygon in linear time
• Multidimensional Sorting
• Constructing Arrangements of Lines and Hyperplanes with Applications