LMT-skeleton heuristics for several new classes of optimal triangulations

DOI10.1016/S0925-7721(00)00016-XzbMath0968.68165OpenAlexW1531723612MaRDI QIDQ1841243

Yang Dai, Siu-Wing Cheng, Naoki Katoh

Publication date: 22 February 2001

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(00)00016-x

zbMATH Keywords

minimum weight triangulationangular balanced triangulationarea balanced triangulationoptimal triangulations

Mathematics Subject Classification ID

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

Related Items (1)

The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation

Cites Work

• Finding minimum area \(k\)-gons
• Computing a subgraph of the minimum weight triangulation
• A large subgraph of the minimum weight triangulation
• Edge insertion for optimal triangulations
• Minimal Triangulations of Polygonal Domains
• An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
• On the Angle Condition in the Finite Element Method
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• Condition of finite element matrices generated from nonuniform meshes.
• Unnamed Item
• Unnamed Item

This page was built for publication: LMT-skeleton heuristics for several new classes of optimal triangulations