Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Automatic restoration of polygon models
ACM Transactions on Graphics (TOG)
Provably good sampling and meshing of surfaces
Graphical Models - Solid modeling theory and applications
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Piecewise algebraic surface computation and smoothing from a discrete model
Computer Aided Geometric Design
Multiscale acquisition and presentation of very large artifacts: The case of portalada
Journal on Computing and Cultural Heritage (JOCCH)
| Hi-index | 0.00 |
In constructing a model of a large twelfth century monument, we face the repair of a huge amount of small to medium-sized defects in the mesh. The total size of the mesh after registration was in the vicinity of 173M-triangles, and presented 14,622 holes of different sizes. Although other algorithms have been presented in the literature to fix these defects, in this case a fully automatic algorithm able to fix most of the defects is needed. In this paper we present the algorithms developed for this purpose, together with examples and results to measure the final surface quality. The algorithm is based on the iteration of smoothing and fitting steps on a uniform B-Spline defined on a 3D box domain bounding the hole. Tricubic and trilinear B-Splines are compared and the respective effectiveness is discussed.