On geodesic properties of polygons relevant to linear time triangulation

DOI10.1007/BF01901482zbMath0668.65022MaRDI QIDQ1118350

Hossam ElGindy, Godfried T. Toussaint

Publication date: 1989

Published in: The Visual Computer (Search for Journal in Brave)

zbMATH Keywords

simple polygonscomputational geometrycrab polygonsgeodesic propertieslinear time triangulation algorithmspalm polygons

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Convex sets in (3) dimensions (including convex surfaces) (52A15) Numerical approximation and computational geometry (primarily algorithms) (65D99) Polytopes and polyhedra (52Bxx)

Related Items (7)

An algorithm for recognizing palm polygons ⋮ On \(k\)-convex polygons ⋮ Starshaped sets ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ Linear-time algorithms for weakly-monotone polygons ⋮ Testing a simple polygon for monotonicity optimally in parallel ⋮ Rotationally monotone polygons

Cites Work

• Unnamed Item
• Triangulating a simple polygon
• Applications of a two-dimensional hidden-line algorithm to other geometric problems
• Visibility of a simple polygon
• A new linear algorithm for triangulating monotone polygons
• Triangulation and shape-complexity
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• A new triangulation-linear class of simple polygons
• A linear algorithm for computing the visibility polygon from a point
• An Optimal Algorithm for Finding the Kernel of a Polygon

This page was built for publication: On geodesic properties of polygons relevant to linear time triangulation