Fast algorithms for computing -skeletons and their relatives.

DOI10.1016/S0031-3203(00)00144-8MaRDI QIDQ5948530zbMATH OpenFDO

Authors S. V. Rao, Asish Mukhopadhyay

Publication date 2001

Published in Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

pattern matchinggeometric graphs

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Output-sensitive algorithm for computing -skeletons
• \(\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
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• A note on Euclidean near neighbor searching in the plane
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• Minimum weight euclidean matching and weighted relative neighborhood graphs
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The \(\gamma\)-neighborhood graph
• The relative neighbourhood graph of a finite planar set

Cited in

(10)

• Efficient edge-skeleton computation for polytopes defined by oracles
• New sequential and parallel algorithms for computing the \(\beta \)-spectrum
• Sublinear randomized algorithms for skeleton decompositions
• \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\)
• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
• On growing connected \(\beta \)-skeletons
• Output-sensitive algorithm for computing \(\beta\)-skeletons
• scientific article; zbMATH DE number 1830717 (Why is no real title available?)
• How \({\beta}\)-skeletons lose their edges

This page was built for publication: Fast algorithms for computing \(\beta\)-skeletons and their relatives.

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