A new linear algorithm for triangulating monotone polygons

DOI10.1016/0167-8655(84)90039-4MaRDI QIDQ3323307zbMATH OpenOpenAlexFDO

Authors Godfried Toussaint

Publication date 1984

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(84)90039-4

zbMATH Keywords

algorithmpattern recognitioncomputational geometrytriangulationimage processingcomputer graphicsmonotone polygonpolygon decomposition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Linear-time algorithms for weakly-monotone polygons
• Triangulating a simple polygon in linear time
• scientific article; zbMATH DE number 4074480
• A new triangulation-linear class of simple polygons
• Triangulating Simple Polygons and Equivalent Problems

Cited in

(13)

• Linear-time algorithms for weakly-monotone polygons
• Computing the shortest diagonal of a monotone polygon in linear time
• On decomposing polygons into uniformly monotone parts
• A non-recursive algorithm for polygon triangulation
• On geodesic properties of polygons relevant to linear time triangulation
• scientific article; zbMATH DE number 7278912 (Why is no real title available?)
• On polyhedra induced by point sets in space
• Computing bushy and thin triangulations
• A new triangulation-linear class of simple polygons
• A local triangulation algorithm to determine the relation between monotone chains
• Monotone Pieces of Chains
• scientific article; zbMATH DE number 3932438 (Why is no real title available?)
• scientific article; zbMATH DE number 4074480 (Why is no real title available?)

This page was built for publication: A new linear algorithm for triangulating monotone polygons

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