On computing new classes of optimal triangulations with angular constraints

DOI10.1007/3-540-68535-9_5MaRDI QIDQ4218403zbMATH OpenFDO

Authors Naoki Katoh, Yang Dai

Publication date 11 November 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68535-9_5

zbMATH Keywords

local optimality

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• LMT-skeleton heuristics for several new classes of optimal triangulations
• Edge insertion for optimal triangulations
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation

Cited in

(4)

• LMT-skeleton heuristics for several new classes of optimal triangulations
• Explicit angle structures for veering triangulations
• Geometric and LP-based heuristics for angular travelling salesman problems in the plane
• A new geometric condition equivalent to the maximum angle condition for tetrahedrons

This page was built for publication: On computing new classes of optimal triangulations with angular constraints

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