Show simple item record

dc.contributor.authorCarr, Nathan A.en_US
dc.contributor.authorHoberock, Jareden_US
dc.contributor.authorCrane, Keenanen_US
dc.contributor.authorHart, John C.en_US
dc.contributor.editorAlla Sheffer and Konrad Polthieren_US
dc.date.accessioned2014-01-29T08:14:05Z
dc.date.available2014-01-29T08:14:05Z
dc.date.issued2006en_US
dc.identifier.isbn3-905673-24-Xen_US
dc.identifier.issn1727-8384en_US
dc.identifier.urihttp://dx.doi.org/10.2312/SGP/SGP06/181-190en_US
dc.description.abstractMany mesh parameterization algorithms have focused on minimizing distortion and utilizing texture area, but few have addressed issues related to processing a signal on the mesh surface.We present an algorithm which partitions a mesh into rectangular charts while preserving a one-to-one texel correspondence across chart boundaries. This mapping permits any computation on the mesh surface which is typically carried out on a regular grid, and prevents seams by ensuring resolution continuity along the boundary. These features are also useful for traditional texture applications such as surface painting where continuity is important. Distortion is comparable to other parameterization schemes, and the rectangular charts yield efficient packing into a texture atlas. We apply this parameterization to texture synthesis, fluid simulation, mesh processing and storage, and locating geodesics.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Geometric algorithmsen_US
dc.titleRectangular Multi-Chart Geometry Imagesen_US
dc.description.seriesinformationSymposium on Geometry Processingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record