On geodesic properties of polygons relevant to linear time triangulation

DOI10.1007/BF01901482MaRDI QIDQ1118350zbMATH OpenFDO

Authors Hossam ElGindy, Godfried Toussaint

Publication date 1989

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

zbMATH Keywords

computational geometrysimple polygonscrab polygonsgeodesic propertieslinear time triangulation algorithmspalm polygons

Mathematics Subject Classification ID

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

Recommendations

• Triangulating a simple polygon in linear time
• Linear-time algorithms for weakly-monotone polygons
• A new triangulation-linear class of simple polygons
• Triangulating Simple Polygons and Equivalent Problems
• A new linear algorithm for triangulating monotone polygons

Cites work

• scientific article; zbMATH DE number 3932438 (Why is no real title available?)
• A linear algorithm for computing the visibility polygon from a point
• A new linear algorithm for triangulating monotone polygons
• A new triangulation-linear class of simple polygons
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• An Optimal Algorithm for Finding the Kernel of a Polygon
• Applications of a two-dimensional hidden-line algorithm to other geometric problems
• Triangulating a simple polygon
• Triangulation and shape-complexity
• Visibility of a simple polygon

Cited in

(10)

• Rotationally monotone polygons
• Linear-time algorithms for weakly-monotone polygons
• Testing a simple polygon for monotonicity optimally in parallel
• Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
• On \(k\)-convex polygons
• An algorithm for recognizing palm polygons
• A new triangulation-linear class of simple polygons
• A linear-time construction of Reuleaux polygons
• Starshaped sets
• Line-of-sight pursuit in monotone and scallop polygons

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

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