Abstract
In this paper we introduce an efficient hole-filling strategy for 3D meshes and at the same time aesthetically recover the sharp features of the original 3D model at the hole areas. Commonly, hole filling techniques try to fill up the hole first then smooth it. Very few have tried to recover the fine features of the original model at the holes. Our hole filling technique 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. 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 by the feature curves and then the hole-filling steps are done on those sub-holes. User intervention is allowed to design features to be in desired shape. This indeed guides feature curve reconstruction wherever ambiguity exists or results are unsatisfactory. It is also very efficient as a user is interfering only with sharp features and the actual hole-filling step is dealing with only simple holes.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attene, M., Falcidieno, B., Rossignac, J., Spagnuolo, M.: Edge-Sharpener: Recovering Sharp Features in Triangulations of Non-adaptively Re-meshed Surfaces. In: Proceedings of the First Eurographics Symposium Geometry Processing (SGP 2003), pp. 63–72. Eurographics Association, Aire-la-Ville (2003)
Barequet, G., Kumar, S.: Repairing CAD Models. In: Proceedings of the 8th Conference on Visualization 1997, pp. 363–371. IEEE Computer Society Press, Los Alamitos (1997)
Barequet, G., Dickerson, M., Eppstein, D.: On triangulating three-dimensional polygons. Journal Computational Geometry: Theory and Applications 10(3), 155–170 (1998)
Chen, C.-Y., Cheng, K.-Y.: A sharpness-dependent filter for recovering sharp features in repaired 3D mesh models. IEEE Transactions on Visualization and Computer Graphics 14(1), 200–212 (2008)
Chen, C.-Y., Cheng, K.-Y., Liao, H.Y.M.: A Sharpness Dependent Approach to 3D Polygon Mesh Hole Filling. In: Proceedings of Annual Conference European Association on Computer Graphics (Eurographics 2005), Short Presentations, pp. 13–16 (2005)
Chew, P.L.: Guaranteed-Quality Triangular Meshes. Technical report 89-983, Department of Computer Science. Cornell University, Ithaca, NY (1989)
Chui, C.K., Lai, M.-J.: Filling Polygonal Holes Using C1 Cubic Triangular Spline Patches. Journal of Computer Aided Geometric Design 17(4), 297–307 (2000)
Dunlop, R.: Introduction to Catmull-Rom Splines. Technical articles, Microsoft DirectX MVP (2005), http://www.mvps.org/directx/articles/catmull/
He, X.J., Chen, Y.H.: A Haptics-guided Hole-filling System Based on Triangular Mesh. Computer Aided Design and Application 3(6), 711–718 (2006)
Jun, Y.: A Piecewise Hole Filling Algorithm in Reverse Engineering. Computer-Aided Design 37(2), 263–270 (2005)
Kobbelt, L.P., Botsch, M., Schwanecke, U., Seidel, H.-P.: Feature Sensitive Surface Extraction from Volume Data. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interative Techniques (SIGGRAPH 2001), pp. 57–66. ACM, New York (2001)
Liepa, P.: Filling holes in Meshes. In: Proceedings of the 2003 Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, pp. 200–205. Eurographics Association, Aire-la-Ville (2003)
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., Seidel, H.-P.: Multi-level Partition of Unity Implicits. Journal of ACM Transaction on Graphics (TOG) - Proceedings of ACM SIGGRAPH 2003 22(3), 463–470 (2003)
Podolak, P., Rusinkiewicz, S.: Atomic Volumes for Mesh Completion. In: Proceedings of the 3rd Eurographics Symposium on Geometry Processing, Eurographics Association Aire-la-Ville, Switzeland (2005)
Sharf, A., Alexa, M., Cohen-Or, D.: Context-based Surface Completion. Journal of ACM Transactions on Graphics – Proceedings of ACM SIGGRAPH 2004 23(3) (2004)
Yoshizawa, S., Belyaev, A.G., Seidel, H.-P.: Fast and Robust Detection of Crest Lines on Meshes. In: Proceedings of the 2005 ACM Symposium on Solid and Physical Modeling, pp. 227–232. ACM, New York (2005)
Yoshizawa, S., Belyaev, A., Yokota, H., Seidel, H.-P.: Fast and Faithful Geometric Algorithm for Detecting Crest Lines on Meshes. In: Proceedings of the 15th Pacific Conference on Graphics Applications, pp. 231–237. Computer Society, Washington, DC (2007)
Zhao, W., Gao, S., Lin, H.: A Robust Hole-Filling Algorithm for Triangular Mesh. Journal of the Visual Computer: International Journal of Computer Graphics 23(12), 987–997 (2007)
Zhao, M., Ma, L., Mao, Z., Li, Z.: Feature Sensitive Hole Filling with Crest Lines. In: Jiao, L., Wang, L., Gao, X.-b., Liu, J., Wu, F. (eds.) ICNC 2006. LNCS, vol. 4222, pp. 660–663. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ngo, H.T.M., Lee, WS. (2013). Feature-First Hole Filling Strategy for 3D Meshes. In: Csurka, G., Kraus, M., Mestetskiy, L., Richard, P., Braz, J. (eds) Computer Vision, Imaging and Computer Graphics. Theory and Applications. VISIGRAPP 2011. Communications in Computer and Information Science, vol 274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32350-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-32350-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32349-2
Online ISBN: 978-3-642-32350-8
eBook Packages: Computer ScienceComputer Science (R0)