Stabbing information of a simple polygon
From MaRDI portal
Publication:1283786
DOI10.1016/S0166-218X(98)00144-9zbMATH Open0972.52006WikidataQ127593015 ScholiaQ127593015MaRDI QIDQ1283786FDOQ1283786
Authors: Hazel Everett, Ferran Hurtado, Marc Noy
Publication date: 30 March 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- The power of geometric duality
- Triangulating a simple polygon in linear time
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Multidimensional Sorting
- Title not available (Why is that?)
- An optimal visibility graph algorithm for triangulated simple polygons
- On-line construction of the convex hull of a simple polyline
Cited In (1)
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)