Output-sensitive algorithm for computing -skeletons

DOI10.1007/S006070070013MaRDI QIDQ1840767zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 2 September 2001

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070070013

zbMATH Keywords

performancealgorithmscomputational geometry\(\beta\)-skeletonplanar set of points

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Fast algorithms for computing \(\beta\)-skeletons and their relatives.
• \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
• New sequential and parallel algorithms for computing the \(\beta \)-spectrum
• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• Optimal and suboptimal robust algorithms for proximity graphs

Cited in

(6)

• \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
• scientific article; zbMATH DE number 1830717 (Why is no real title available?)
• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• New sequential and parallel algorithms for computing the \(\beta \)-spectrum
• How \({\beta}\)-skeletons lose their edges
• Fast algorithms for computing \(\beta\)-skeletons and their relatives.

This page was built for publication: Output-sensitive algorithm for computing \(\beta\)-skeletons

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