A heuristic triangulation algorithm
From MaRDI portal
Publication:3776650
DOI10.1016/0196-6774(87)90020-4zbMath0636.68080OpenAlexW2053335419MaRDI QIDQ3776650
Jiarong Hong, David Alan Plaisted
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(87)90020-4
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items
Computing a subgraph of the minimum weight triangulation ⋮ New results for the minimum weight triangulation problem ⋮ A fast heuristic for approximating the minimum weight triangulation ⋮ Improved heuristics for the minimum weight triangulation problem ⋮ Constrained independence system and triangulations of planar point sets ⋮ FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM ⋮ Fast greedy triangulation algorithms. ⋮ 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 ⋮ On \(\beta\)-skeleton as a subgraph of the minimum weight triangulation ⋮ A fixed parameter algorithm for optimal convex partitions ⋮ Unnamed Item ⋮ Polynomial-time instances of the minimum weight triangulation problem ⋮ Approximating the minimum weight Steiner triangulation
This page was built for publication: A heuristic triangulation algorithm
