Applications of a two-dimensional hidden-line algorithm to other geometric problems

DOI10.1007/BF02263430MaRDI QIDQ1838318zbMATH OpenFDO

Authors Hossam ElGindy, Godfried Toussaint, David Avis

Publication date 1983

Published in Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmstriangulationconvex hullvisibilitygeometric complexitysimple polygonsedge visible polygonL-convex polygon

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Convex sets in (2) dimensions (including convex curves) (52A10) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cites work

• A linear algorithm for computing the visibility polygon from a point
• A linear algorithm for finding the convex hull of a simple polygon
• An Optimal Algorithm for Finding the Kernel of a Polygon
• An efficient algorithm for determining the convex hull of a finite planar set
• Finding the convex hull of a simple polygon
• Measuring Concavity on a Rectangular Mosaic
• Some properties of \(L\) sets in the plane
• Triangulating a simple polygon

Cited in

(2)

• On geodesic properties of polygons relevant to linear time triangulation
• Visibility between two edges of a simple polygon

This page was built for publication: Applications of a two-dimensional hidden-line algorithm to other geometric problems

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