DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND

DOI10.1142/S0218195902000979zbMath1152.68656MaRDI QIDQ4818571

Prosenjit Bose, Luc P. Devroye, William S. Evans

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

probabilistic analysiscomputational geometrylight edgesminimum weight triangulationslocally minimal triangulations

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A linear time algorithm for max-min length triangulation of a convex polygon ⋮ A new asymmetric inclusion region for minimum weight triangulation ⋮ FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM ⋮ A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations ⋮ The minimum weight triangulation problem with few inner points ⋮ Unnamed Item

Cites Work

• Computing a subgraph of the minimum weight triangulation
• Weighted sums of certain dependent random variables
• Minimal Triangulations of Polygonal Domains
• Probability Inequalities for Sums of Bounded Random Variables

This page was built for publication: DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND