A new linear algorithm for triangulating monotone polygons
From MaRDI portal
Publication:3323307
DOI10.1016/0167-8655(84)90039-4zbMath0537.68089OpenAlexW2092072528MaRDI QIDQ3323307
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
algorithmtriangulationpattern recognitionimage processingcomputer graphicscomputational geometrypolygon decompositionmonotone polygon
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Pattern recognition, speech recognition (68T10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (3)
On geodesic properties of polygons relevant to linear time triangulation ⋮ On polyhedra induced by point sets in space ⋮ Computing bushy and thin triangulations
This page was built for publication: A new linear algorithm for triangulating monotone polygons
