FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM

DOI10.1142/S0218195908002581zbMath1147.65018OpenAlexW2126716943MaRDI QIDQ3520429

Magdalene Grantson Borgelt, Christian Borgelt, Christos Levcopoulos

Publication date: 26 August 2008

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195908002581

zbMATH Keywords

dynamic programmingnumerical examplespolygonminimum weight triangulationfixed parameter algorithmdivide-and-conquer algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Dynamic programming (90C39) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

A fixed parameter algorithm for optimal convex partitions ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Finding a minimal cover for binary images: An optimal parallel algorithm
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• The Boolean Basis Problem and How to Cover Some Polygons by Rectangles
• A heuristic triangulation algorithm
• A New Heuristic for Minimum Weight Triangulation
• Minimal Triangulations of Polygonal Domains
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
• DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
• A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations
• On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation

This page was built for publication: FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM