Name
Abstract | ||
|---|---|---|
A method for corresponding the triangulated mesh surface representations of two shapes is presented. It comprises a method of polyhedral mesh decimation and a symmetric version of the iterative Closest Point (ICP) algorithm. The method produces a matching pair of sparse polyhedral approximations, one for each shape surface, using a global Euclidean measure of similarity. A method of surface patch parameterisation is presented which uses minimal paths constructed across the surface of a polyhedron. We describe the use of this patch parameterisation in the interpolation of surfaces for the construction of a merged mean shape with a densely triangulated surface. Results are presented for the production of a binary tree of merged biological shapes which may be used as a basis for the automated landmarking of a set of examples. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1016/S0262-8856(98)00184-X | Image and Vision Computing |
Keywords | Field | DocType |
Automated landmarking,3D,point distribution models,Correspondence | Decimation,Parametrization,Interpolation,Polyhedron,Binary tree,Triangulation,Euclidean geometry,Geometry,Mathematics,Iterative closest point | Journal |
Volume | Issue | ISSN |
17 | 8 | 0262-8856 |
Citations | PageRank | References |
9 | 1.00 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan D. Brett | 1 | 162 | 16.85 |
| A. Hill | 2 | 708 | 203.95 |
| C.J. Taylor | 3 | 9 | 1.00 |