Full metadata record
DC FieldValueLanguage
dc.contributor.authorLivesu, Marco
dc.contributor.authorScatenni, Ricardo
dc.contributor.editorSkala, Václav
dc.identifier.citationJournal of WSCG. 2013, vol. 21, no. 1, p. 1-10.en
dc.identifier.issn1213–6972 (hardcopy)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213–6964 (on-line)
dc.description.abstractDifferent poses of 3D models are very often given in different positions and orientations in space. Since most of the computer graphics algorithms do not satisfy geometric invariance, it is very important to bring shapes into a canonical coordinate frame before any processing. In this paper we consider the problem of finding the best alignment between two or more different poses of the same object represented by triangle meshes sharing the same connectivity. Firstly, we developed a method to select a region of interest (ROI) which has a perfect alignment over the two poses (up to a rigid movement). Secondary, we solved a simplified version of the Largest Common Point-set (LCP) problem with a-priori knowledge about point correspondence, in order to align the ROIs. We eventually align the poses performing least square rigid registration. Our method makes no assumption about the starting positions of the objects and can also be used with more than two poses at once. It is fast, non-iterative, easy to reproduce and brings the poses into the best alignment whatever the initial positions are.en
dc.format10 s.cs
dc.publisherVáclav Skala - Union Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subject3D modelycs
dc.subjectregistrace poziccs
dc.subjectnumerické metodycs
dc.titleRigid registration of different poses of animated shapesen
dc.subject.translated3D modelsen
dc.subject.translatedpose registrationen
dc.subject.translatednumerical methodsen
Appears in Collections:Volume 21, Number 1 (2013)

Files in This Item:
File Description SizeFormat 
Livesu.pdfPlný text3,58 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/6870

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.