A linear-time near-optimum-length triangulation algorithm for convex polygons

DOI10.1016/S0022-0000(05)80052-2zbMath0941.68777OpenAlexW2087855749MaRDI QIDQ1337467

Vitit Kantabutra

Publication date: 26 February 1996

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(05)80052-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A linear-time near-optimum-length triangulation algorithm for convex polygons