Fast algorithms for computing \(\beta\)-skeletons and their relatives.

DOI10.1016/S0031-3203(00)00144-8zbMath1053.68090MaRDI QIDQ5948530

No author found.

Publication date: 2001

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

geometric graphspattern matching

Mathematics Subject Classification ID

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

Related Items (1)

GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING

Cites Work

• Unnamed Item
• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• The relative neighbourhood graph of a finite planar set
• Constructing the relative neighborhood graph in 3-dimensional Euclidean space
• The \(\gamma\)-neighborhood graph
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• A note on Euclidean near neighbor searching in the plane
• A linear-time construction of the relative neighborhood graph from the Delaunay triangulation
• The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees
• Minimum weight euclidean matching and weighted relative neighborhood graphs

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