Computing a minimum weight triangulation of a sparse point set

DOI10.1023/A:1008348111045MaRDI QIDQ1304398zbMATH OpenOpenAlexFDO

Authors Cao An Wang, Yinfeng 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

computational geometryminimum weight triangulationsufficient condition for finding subgraphs

Mathematics Subject Classification ID

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

Recommendations

• New results for the minimum weight triangulation problem
• A New Heuristic for Minimum Weight Triangulation
• A large subgraph of the minimum weight triangulation
• A new subgraph of minimum weight triangulations

Cited in

(6)

• scientific article; zbMATH DE number 7760161 (Why is no real title available?)
• Computing the weight distribution of a set of points obtained by scaling, shifting, and truncating a lattice
• scientific article; zbMATH DE number 5031929 (Why is no real title available?)
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets
• Computing bushy and thin triangulations
• 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

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