Sciweavers

449 search results - page 43 / 90
» Measuring the Similarity of Geometric Graphs
Sort
View
COMPGEOM
2009
ACM
16 years 21 days ago
Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
Jean-Daniel Boissonnat, Olivier Devillers, Samuel ...
PAMI
1998
107views more  PAMI 1998»
15 years 5 months ago
Graph Matching With a Dual-Step EM Algorithm
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
Andrew D. J. Cross, Edwin R. Hancock
IDA
2000
Springer
15 years 6 months ago
Supervised model-based visualization of high-dimensional data
When high-dimensional data vectors are visualized on a two- or three-dimensional display, the goal is that two vectors close to each other in the multi-dimensional space should als...
Petri Kontkanen, Jussi Lahtinen, Petri Myllymä...
CCCG
2008
15 years 7 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath
FIMH
2009
Springer
16 years 23 days ago
Cardiac Fibre Trace Clustering for the Interpretation of the Human Heart Architecture
Cardiac fibre architecture plays a key role in heart function. Recently, the estimation of fibre structure has been simplified with diffusion tensor MRI (DT-MRI). In order to as...
Carole Frindel, Marc C. Robini, Joël Schaerer...