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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
