Hanh T.-M. Ngo, Won-Sook Lee


Most hole filling approaches use techniques to fill up a hole first and then to smooth it. Very few tries rebuild features on the filled surface of the original 3D model. We propose an efficient hole-filling methodology which preserves sharp features of the geometry of the original model. The main idea is that we reconstruct feature curves in the missing parts of the given mesh before filling the hole with smoothing surface. The feature curves in the missing part are reconstructed by extending salient features of the existing parts. The hole is partitioned into several smaller and more planar sub-holes divided by the feature curves and then the hole-filling step follows. User intervention is available to design the features to be desired shape to guide feature curve reconstruction wherever ambiguity exists or results are unsatisfactory. Our hole filling techniques is different from other existing techniques as features are taken as the first subject to reconstruct, which eventually drive the feature-definite surface filling process. It is also very efficient as a user is interfering only with features and the actual hole-filling step is dealing with only planar holes.


  1. Attene, M., Falcidieno, B., Rossignac, J., Spagnuolo, M., 2003. Edge-Sharpener: Recovering Sharp Features in Triangulations of Non-adaptively Re-meshed Surfaces. In Proceedings of the First Eurographics Symposium Geometry Processing (SGP'03), pages 63- 72.
  2. Barequet, G., Kumar, S., 1997. Repairing CAD Models. In Proceedings of the 8th conference on Visualization 7897, pages 363-371, Phoenix, Arizona, USA.
  3. Barequet, G., Dickerson, M., Eppstein, D., 1998. On triangulating three-dimensional polygons. Computational Geometry: Theory and Applications, 10(3) pages 155-170.
  4. Chen, C.-Y., Cheng, K.-Y., 2008. A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models. IEEE Transactions on Visualization and Computer Graphics, volume 14, No. 1, January/February 2008.
  5. Chen, C.-Y., Cheng, K.-Y., Liao, H. Y. M., 2005. A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling. Eurographics, Short Presentations, 2005.
  6. Chew, P. L., 1989. Guaranteed-Quality Triangular Meshes. Technical report 89-983, Department of Computer Science, Cornell University, Ithaca, NY, April 1989.
  7. Chui, C. K., Lai, M.-J., 2000. Filling Polygonal Holes Using C1 Cubic Triangular Spline Patches. Computer Aided Geometric Design, volume 17(2000), pages 297-307.
  8. Dunlop, R., 2005. Introduction to Catmull-Rom Splines. Technical articles, Microsoft DirectX MVP. URL:
  9. He, X. J., Chen, Y. H., 2006. A Haptics-guided Holefilling System Based on Triangular Mesh. Computer Aided Design and Application, volume 3(6), pages 711-718.
  10. Jun, Y., 2005. A Piecewise Hole Filling Algorithm in Reverse Engineering. Computer-Aided Design 37, pages 263-270.
  11. Kobbelt, L. P., Botsch, M., Schwanecke, U., Seidel, H.-P., 2001. Feature Sensitive Surface Extraction from Volume Data. In Proc. of ACM SIGGRAPH 2001, pages 57-66.
  12. Liepa, P., 2003. Filling holes in Meshes. In Proceedings of the Eurographics/ACM SIGGRAPH symposium on Geometry Processing 2003, Eurographics Association, pages 200-205.
  13. Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., Seidel, H.- P., 2003. Multi-level Partition of Unity Implicits. ACM Trans. Graphics, Proc. ACM SIGGRAPH 2003, volume 22(3), pages 463-470.
  14. Podolak, P., Rusinkiewicz, S.2005. Atomic Volumes for Mesh Completion. In Proceedings of Eurographics Symposium on Geometry Processing, Dublin, Ireland, 29 August-2 September 2005, pages 33-41, Blackwell Press 2005.
  15. Sharf, A., Alexa, M., Cohen-Or, D., 2004. Context-based Surface Completion. ACM Transactions on Graphics, SIGGRAPH 04, 23, 3.
  16. Yoshizawa, S., Belyaev, A.G., Seidel, H.-P., 2005. Fast and Robust Detection of Crest Lines on Meshes. ACM Symposium on Solid and Physical Modeling, pages 227-232, Technical Sketch, June 13-15, 2005, MIT, Cambridge, MA.
  17. Yoshizawa, S., Belyaev, A., Yokota, H., Seidel, H.-P., 2007. Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes. Pacific Graphics, pages 231-237, October 29-November 2, 2007, Maui, Hawaii.
  18. Zhao, W., Gao, S., Lin, H., 2007. A Robust Hole-Filling Algorithm for Triangular Mesh. Visual Computer 23, pages 987-997.
  19. Zhao, M., Ma, L., Mao, Z., Li, Z., 2006. Feature Sensitive Hole Filling with Crest Lines. Lecture notes in Computer Science. In Proc. of Advances in Natural Computation. The Second International Conference on Natural Computation, Xi'an, China.

Paper Citation

in Harvard Style

T.-M. Ngo H. and Lee W. (2011). USER-GUIDED FEATURE SENSITIVE HOLE FILLING FOR 3D MESHES . In Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011) ISBN 978-989-8425-45-4, pages 49-58. DOI: 10.5220/0003324700490058

in Bibtex Style

author={Hanh T.-M. Ngo and Won-Sook Lee},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)},

in EndNote Style

JO - Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)
SN - 978-989-8425-45-4
AU - T.-M. Ngo H.
AU - Lee W.
PY - 2011
SP - 49
EP - 58
DO - 10.5220/0003324700490058