Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

DOI10.1006/JAGM.1997.0918MaRDI QIDQ4216140zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 871937
• On approximation behavior of the greedy triangulation for convex polygons
• scientific article; zbMATH DE number 742947
• scientific article; zbMATH DE number 1496856

Cited in

(22)

• Quadtree, ray shooting and approximate minimum weight Steiner triangulation
• Minimum weight convex Steiner partitions
• A note on a QPTAS for maximum weight triangulation of planar point sets
• On exclusion regions for optimal triangulations
• On a linear program for minimum-weight triangulation
• A grid-based approximation algorithm for the minimum weight triangulation problem
• scientific article; zbMATH DE number 742947 (Why is no real title available?)
• Approximating the minimum weight Steiner triangulation
• A new asymmetric inclusion region for minimum weight triangulation
• An almost four-approximation algorithm for maximum weight triangulation
• Minimum weight pseudo-triangulations
• A linear time algorithm for max-min length triangulation of a convex polygon
• On minimum weight pseudo-triangulations
• The minimum weight triangulation problem with few inner points
• scientific article; zbMATH DE number 871937 (Why is no real title available?)
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
• Decomposing a simple polygon into pseudo-triangles and convex polygons
• A quasi-polynomial time approximation scheme for minimum weight triangulation
• The drawability problem for minimum weight triangulations
• A fixed parameter algorithm for optimal convex partitions
• FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216140)