A quasi-polynomial time approximation scheme for minimum weight triangulation

DOI10.1145/1516512.1516517zbMath1325.68258OpenAlexW1969752905MaRDI QIDQ5899509

Jan Remy, Angelika Steger

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1516512.1516517

zbMATH Keywords

minimum weight triangulationapproximation algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

A note on a QPTAS for maximum weight triangulation of planar point sets ⋮ Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand ⋮ Unnamed Item

This page was built for publication: A quasi-polynomial time approximation scheme for minimum weight triangulation