Robust repair of polygonal models
- 1 August 2004
- journal article
- conference paper
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 23 (3) , 888-895
- https://doi.org/10.1145/1015706.1015815
Abstract
We present a robust method for repairing arbitrary polygon models. The method is guaranteed to produce a closed surface that partitions the space into disjoint internal and external volumes. Given any model represented as a polygon soup, we construct an inside/outside volume using an octree grid, and reconstruct the surface by contouring. Our novel algorithm can efficiently process large models containing millions of polygons and is capable of reproducing sharp features in the original geometry.Keywords
This publication has 20 references indexed in Scilit:
- Multi-level partition of unity implicitsACM Transactions on Graphics, 2003
- Simplification and repair of polygonal models using volumetric techniquesIEEE Transactions on Visualization and Computer Graphics, 2003
- Dual contouring of hermite dataACM Transactions on Graphics, 2002
- Topology-reducing surface simplification using a discrete solid representationACM Transactions on Graphics, 2002
- Feature sensitive surface extraction from volume dataPublished by Association for Computing Machinery (ACM) ,2001
- Adaptively sampled distance fieldsPublished by Association for Computing Machinery (ACM) ,2000
- Space efficient connectivity test forn-dimensional imagesComputers & Graphics, 1998
- Simplification envelopesPublished by Association for Computing Machinery (ACM) ,1996
- Solid representation and operation using extended octreesACM Transactions on Graphics, 1990
- Solution of the problem of PlateauTransactions of the American Mathematical Society, 1931