An algorithm for constructing locally optimal min-max triangulation

DOI10.1017/S0004972700015161MaRDI QIDQ4346968zbMATH OpenFDO

Authors Manjulata Shrivastava

Publication date 4 March 2001

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

algorithmlocally optimal triangulationmin-max-angle criterionneutral et curves

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• scientific article; zbMATH DE number 1305489
• An optimal algorithm for finding minimal enclosing triangles
• An exact algorithm for the minimum dilation triangulation problem
• A wide-range algorithm for minimal triangulation from an arbitrary ordering
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• scientific article; zbMATH DE number 1947421
• Fast minimal triangulation algorithm using minimum degree criterion
• A linear time algorithm for max-min length triangulation of a convex polygon
• On a linear program for minimum-weight triangulation

Cites work

• The neutral case for the min-max triangulation

Cited in

(8)

• Quality Triangulations with Locally Optimal Steiner Points
• Multicriteria-optimized triangulations
• scientific article; zbMATH DE number 1985293 (Why is no real title available?)
• LMT-skeleton heuristics for several new classes of optimal triangulations
• scientific article; zbMATH DE number 2164145 (Why is no real title available?)
• The neutral case for the min-max triangulation
• The neutral case for the min-max angle criterion: A generalized concept
• scientific article; zbMATH DE number 1305489 (Why is no real title available?)

This page was built for publication: An algorithm for constructing locally optimal min-max triangulation

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