A linear-time approximation scheme for maximum weight triangulation of convex polygons

DOI10.1007/s00453-004-1101-6zbMath1082.68119OpenAlexW2010369728MaRDI QIDQ1762986

Jianbo Qian, Cao An Wang

Publication date: 11 February 2005

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1101-6

zbMATH Keywords

AlgorithmConvex polygonApproximation schemeMaximum weight triangulation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Polyhedral manifolds (52B70)

Related Items (3)

A linear time algorithm for max-min length triangulation of a convex polygon ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ An almost four-approximation algorithm for maximum weight triangulation

This page was built for publication: A linear-time approximation scheme for maximum weight triangulation of convex polygons