Applications of a two-dimensional hidden-line algorithm to other geometric problems
From MaRDI portal
Publication:1838318
DOI10.1007/BF02263430zbMath0509.68067MaRDI QIDQ1838318
Godfried T. Toussaint, Hossam ElGindy, David Avis
Publication date: 1983
Published in: Computing (Search for Journal in Brave)
algorithmstriangulationconvex hullsimple polygonsvisibilitygeometric complexityedge visible polygonL-convex polygon
Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Discrete mathematics in relation to computer science (68R99)
Related Items (2)
Visibility between two edges of a simple polygon ⋮ On geodesic properties of polygons relevant to linear time triangulation
Cites Work
- A linear algorithm for finding the convex hull of a simple polygon
- Triangulating a simple polygon
- An efficient algorithm for determining the convex hull of a finite planar set
- Some properties of \(L\) sets in the plane
- A linear algorithm for computing the visibility polygon from a point
- An Optimal Algorithm for Finding the Kernel of a Polygon
- Measuring Concavity on a Rectangular Mosaic
- Finding the convex hull of a simple polygon
This page was built for publication: Applications of a two-dimensional hidden-line algorithm to other geometric problems
