A heuristic triangulation algorithm

DOI10.1016/0196-6774(87)90020-4MaRDI QIDQ3776650zbMATH OpenOpenAlexFDO

Authors Jiarong Hong, David A. 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

zbMATH Keywords

heuristic triangulation algorithmpolynomial time

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• Algorithms for triangulations
• A non-recursive algorithm for polygon triangulation
• A heuristic algorithm for solving triangle packing problem
• A New Heuristic for Minimum Weight Triangulation
• A space efficient greedy triangulation algorithm
• scientific article; zbMATH DE number 1305489
• A contribution to triangulation algorithms for simple polygons
• Triangle-Based Heuristics for Area Optimal Polygonizations
• An efficient algorithm for enumeration of triangulations
• scientific article; zbMATH DE number 1139074

Cited in

(23)

• A fixed parameter algorithm for optimal convex partitions
• Polynomial-time instances of the minimum weight triangulation problem
• Approximating the minimum weight Steiner triangulation
• Computing a subgraph of the minimum weight triangulation
• New results for the minimum weight triangulation problem
• Improved heuristics for the minimum weight triangulation problem
• An almost four-approximation algorithm for maximum weight triangulation
• Fast greedy triangulation algorithms.
• One method for triangulation a set of points in the plane
• FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
• Surface realization with the intersection segment functional
• scientific article; zbMATH DE number 4064506 (Why is no real title available?)
• A New Heuristic for Minimum Weight Triangulation
• On a conjecture by Plaisted and Hong
• scientific article; zbMATH DE number 3179549 (Why is no real title available?)
• scientific article; zbMATH DE number 2010049 (Why is no real title available?)
• Spiral serpentine polygonization of a planar point set
• A fast heuristic for approximating the minimum weight triangulation
• Minimum weight convex Steiner partitions
• On a linear program for minimum-weight triangulation
• A lower bound for -skeleton belonging to minimum weight triangulations
• On -skeleton as a subgraph of the minimum weight triangulation
• Constrained independence system and triangulations of planar point sets

This page was built for publication: A heuristic triangulation algorithm

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