Matching Delaunay graphs

DOI10.1016/S0031-3203(96)00060-XzbMath0866.68115OpenAlexW2014910581WikidataQ62523671 ScholiaQ62523671MaRDI QIDQ676779

Andrew M. Finch, Richard C. Wilson, Edwin R. Hancock

Publication date: 6 July 1997

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

Full work available at URL: https://doi.org/10.1016/s0031-3203(96)00060-x

zbMATH Keywords

Voronoi tessellationsvolumetric surface data

Mathematics Subject Classification ID

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

Related Items (6)

Text region extraction in a document image based on the Delaunay tessellation ⋮ Fuzzy morphisms between graphs ⋮ Clique descriptor of affine invariant regions for robust wide baseline image matching ⋮ An applied point pattern matching problem: Comparing 2D patterns of protein spots ⋮ Relational object recognition from large structural libraries ⋮ Point matching under non-uniform distortions.

Cites Work

• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• Representing stereo data with the Delaunay triangulation
• Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Scene Labeling by Relaxation Operations
• A distance measure between attributed relational graphs for pattern recognition

This page was built for publication: Matching Delaunay graphs