A linear-time approximation scheme for minimum weight triangulation of convex polygons
From MaRDI portal
Publication:1393070
DOI10.1007/PL00009216zbMath0899.68108OpenAlexW1995302928MaRDI QIDQ1393070
Christos Levcopoulos, Drago Krznaric
Publication date: 2 August 1998
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009216
Related Items (2)
An almost four-approximation algorithm for maximum weight triangulation ⋮ The drawability problem for minimum weight triangulations
This page was built for publication: A linear-time approximation scheme for minimum weight triangulation of convex polygons