On exclusion regions for optimal triangulations

DOI10.1016/S0166-218X(00)00236-5zbMath0967.68158OpenAlexW2067611064WikidataQ56970738 ScholiaQ56970738MaRDI QIDQ5929321

Robert L. Scot Drysdale, Scott A. McElfresh, Jack Scott Snoeyink

Publication date: 4 April 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00236-5

zbMATH Keywords

minimum weight triangulationtriangulation edge

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New results on MWT subgraphs
• On the average length of Delaunay triangulations
• Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
• Computing a subgraph of the minimum weight triangulation
• New results for the minimum weight triangulation problem
• A large subgraph of the minimum weight triangulation
• Fast greedy triangulation algorithms.
• Minimal Triangulations of Polygonal Domains
• Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

This page was built for publication: On exclusion regions for optimal triangulations