Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

DOI10.1006/jagm.1997.0918zbMath0916.68179OpenAlexW4256149448MaRDI QIDQ4216140

Drago Krznaric, Christos Levcopoulos

Publication date: 2 December 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0918

zbMATH Keywords

minimum weight triangulationgreedy triangulation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (15)

A linear time algorithm for max-min length triangulation of a convex polygon ⋮ Minimum weight pseudo-triangulations ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM ⋮ On minimum weight pseudo-triangulations ⋮ A note on a QPTAS for maximum weight triangulation of planar point sets ⋮ Decomposing a simple polygon into pseudo-triangles and convex polygons ⋮ On exclusion regions for optimal triangulations ⋮ Minimum weight convex Steiner partitions ⋮ A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations ⋮ An almost four-approximation algorithm for maximum weight triangulation ⋮ The minimum weight triangulation problem with few inner points ⋮ The drawability problem for minimum weight triangulations ⋮ A fixed parameter algorithm for optimal convex partitions ⋮ Unnamed Item

This page was built for publication: Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation