Rectangular Multi-Chart Geometry Images
| dc.contributor.author | Carr, Nathan A. | en_US |
| dc.contributor.author | Hoberock, Jared | en_US |
| dc.contributor.author | Crane, Keenan | en_US |
| dc.contributor.author | Hart, John C. | en_US |
| dc.contributor.editor | Alla Sheffer and Konrad Polthier | en_US |
| dc.date.accessioned | 2014-01-29T08:14:05Z | |
| dc.date.available | 2014-01-29T08:14:05Z | |
| dc.date.issued | 2006 | en_US |
| dc.description.abstract | Many 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.description.seriesinformation | Symposium on Geometry Processing | en_US |
| dc.identifier.isbn | 3-905673-24-X | en_US |
| dc.identifier.issn | 1727-8384 | en_US |
| dc.identifier.uri | https://doi.org/10.2312/SGP/SGP06/181-190 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Geometric algorithms | en_US |
| dc.title | Rectangular Multi-Chart Geometry Images | en_US |
Files
Original bundle
1 - 1 of 1