Stabbing information of a simple polygon

DOI10.1016/S0166-218X(98)00144-9MaRDI QIDQ1283786zbMATH OpenWikidataFDO

Authors Hazel Everett, Ferran Hurtado, Marc Noy

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)

Recommendations

• Orthogonal polygon reconstruction from stabbing information
• New results on stabbing segments with a polygon
• New results on stabbing segments with a polygon
• Finding stabbing lines in 3-space
• Ray shooting in polygons using geodesic triangulations

Cites work

• scientific article; zbMATH DE number 431988 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• An optimal visibility graph algorithm for triangulated simple polygons
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Multidimensional Sorting
• On-line construction of the convex hull of a simple polyline
• The power of geometric duality
• Triangulating a simple polygon in linear time

Cited in

(1)

• Orthogonal polygon reconstruction from stabbing information

This page was built for publication: Stabbing information of a simple polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283786)