Computing

, 86:101 | Cite as

Massive mesh hole repair minimizing user intervention

  • Pere Brunet
  • Antoni Chica
  • Isabel Navazo
  • Àlvar Vinacua
Article

Abstract

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.

Keywords

Geometric modeling Mesh repair Algebraic surfaces 

Mathematics Subject Classification (2000)

68U05 

References

  1. 1.
    Besora I, Brunet P, Callieri M, Chica A, Corsini M, Dellepiane M, Morales D, Moyés J, Ranzuglia G, Scopigno R (2008) Portalada: a virtual reconstruction of the entrance of the Ripoll monastery. In: 3DPVT08: fourth international symposium on 3D data processing, visualization and transmission, pp 89–96Google Scholar
  2. 2.
    Besora I, Brunet P, Chica A, Moyés J (2008) Real-time exploration of the virtual reconstruction of the entrance of the Ripoll monastery. In: CEIG 2008 conference proceedings, pp 219–224Google Scholar
  3. 3.
    Bischoff S, Kobbelt L (2005) Structure preserving cad model repair. Comput Graph Forum 24(3): 527–536CrossRefGoogle Scholar
  4. 4.
    Bischoff S, Pavic D, Kobbelt L (2005) Automatic restoration of polygon models. ACM Trans Graph 24(4): 1332–1352CrossRefGoogle Scholar
  5. 5.
    Boissonnat JD, Oudot S (2005) Provably good sampling and meshing of surfaces. Graph Models 67(5): 405–451MATHCrossRefGoogle Scholar
  6. 6.
    Esteve J, Brunet P, Vinacua A (2008) Piecewise algebraic surface computation and smoothing from a discrete model. Comput Aided Geom Des 25(6): 357–372CrossRefMathSciNetGoogle Scholar
  7. 7.
    Hornung A, Kobbelt L (2006) Hierarchical volumetric multi-view stereo reconstruction of manifold surfaces based on dual graph embedding. In: CVPR ’06 Proceedings of the 2006 IEEE Computer Society Conference on computer vision and pattern recognition, pp 503–510Google Scholar
  8. 8.
    Hornung A, Kobbelt L (2006) Robust reconstruction of watertight 3d models from non-uniformly sampled point clouds without normal information. In: SGP ’06 Proceedings of the fourth Eurographics symposium on geometry processing, pp 41–50Google Scholar
  9. 9.
    Ju T (2004) Robust repair of polygonal models. ACM Trans Graph 23(3): 888–895CrossRefGoogle Scholar
  10. 10.
    Liepa P (2003) Filling holes in meshes. In: SGP ’03 Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on geometry processing, pp 200–205Google Scholar
  11. 11.
    Murali T, Funkhouser T (1997) Consistent solid and boundary representations from arbitrary polygonal data. In: Proceedings of the 1997 symposium on interactive 3D graphics, pp 155–162Google Scholar
  12. 12.
    Nooruddin FS, Turk G (2003) Simplification and repair of polygonal models using volumetric techniques. IEEE Trans Vis Comp Graph 9(2): 191–205CrossRefGoogle Scholar
  13. 13.
    Turk G, Levoy M (1994) Zippered polygon meshes from range images. In: SIGGRAPH ’94 Proceedings of the 21st annual conference on computer graphics and interactive techniques, pp 311–318Google Scholar

Copyright information

© Springer-Verlag 2009

Authors and Affiliations

  • Pere Brunet
    • 1
  • Antoni Chica
    • 1
  • Isabel Navazo
    • 1
  • Àlvar Vinacua
    • 1
  1. 1.Software DepartmentUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations