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)

Full work available at URL https://doi.org/10.1016/S0031-3203(00)00144-8

zbMATH Keywords

geometric graphspattern matching

Mathematics Subject Classification ID

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

Recommendations

• Output-sensitive algorithm for computing -skeletons
• -skeletons for a set of line segments in R^2
• New sequential and parallel algorithms for computing the -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

• 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
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• 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 \(\gamma\)-neighborhood graph
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• The relative neighbourhood graph of a finite planar set

Cited in

(11)

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

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)