Atomic Volumes for Mesh Completion
| dc.contributor.author | Podolak, Joshua | en_US |
| dc.contributor.author | Rusinkiewicz, Szymon | en_US |
| dc.contributor.editor | Mathieu Desbrun and Helmut Pottmann | en_US |
| dc.date.accessioned | 2014-01-29T09:31:06Z | |
| dc.date.available | 2014-01-29T09:31:06Z | |
| dc.date.issued | 2005 | en_US |
| dc.description.abstract | The increased use of scanned geometry for applications in computer graphics and 3D hardcopy output has highlighted the need for general, robust algorithms for reconstruction of watertight 3D models given partial polygonal meshes as input. We present an algorithm for 3D hole filling based on a decomposition of space into atomic volumes, which are each determined to be either completely inside or completely outside the model. By defining the output model as the union of interior atomic volumes we guarantee that the resulting mesh is watertight. Individual volumes are labeled as "inside" or "outside" by computing a minimum-cost cut of a graph representation of the atomic volume structure, patching all the holes simultaneously in a globally sensitive manner. User control is provided to select between multiple topologically distinct, yet still valid, ways of filling holes. Finally, we use an octree decomposition of space to provide output-sensitive computation time. We demonstrate the ability of our algorithm to fill complex, non-planar holes in large meshes obtained from 3D scanning devices. | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Geometry Processing 2005 | 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/SGP05/033-041 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.title | Atomic Volumes for Mesh Completion | en_US |
Files
Original bundle
1 - 1 of 1