Computing a minimum weight triangulation of a sparse point set

DOI10.1023/A:1008348111045zbMath0953.90061OpenAlexW2152688962MaRDI QIDQ1304398

Cao An Wang, Yin-Feng Xu

Publication date: 30 January 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008348111045

zbMATH Keywords

minimum weight triangulationcomputational geometrysufficient condition for finding subgraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

A lower bound for \(\beta\)-skeleton belonging to minimum weight triangulations

This page was built for publication: Computing a minimum weight triangulation of a sparse point set