Abstract
Point based graphics avoids the generation of a polygonal approximation of sampled geometry and uses algorithms that directly work with the point set.
Basic ingredients of point based methods are algorithms to compute nearest neighbors, to estimate surface properties as, e.g. normals and to smooth the point set. In this paper we report on the results of an experimental study that compared different methods for the mentioned subtasks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., Silva, C. T.: Point set surfaces. In: Proc. Conf. on Visualization '01, pp. 21–28. IEEE Computer Society 2001.
Amenta, N., Choi, S., Krishna Kolluri, R.: The power crust. In: Proc. 6th ACM Symp. on Solid Modeling and Applications, pp. 249–266. ACM Press 2001.
Belyaev, A., Ohtake, Y.: A comparison of mesh smoothing methods. In: Israel-Korea Bi-National Conf. on Geometric Modeling and Computer Graphics, pp. 83–87. Tel Aviv University 2003.
Desbrun, M., Meyer, M., Schröder, P., Barr, A. H.: Implicit fairing of irregular meshes using diffusion and curvature flow. In: SIGGRAPH '99, pp. 317–324. ACM Press/Addison-Wesley 1999.
Dey, T. K., Goswami, S., Sun, J.: Smoothing noisy point clouds with delaunay preprocessing and mls. Technical Report OSU-CISRC-3/04-TR17, Ohio-State University 2004.
Dey, T. K., Goswami, S.: Provable surface reconstruction from noisy samples. In: Proc. 20th Annual Symp. on Computational Geometry, pp. 330–339. ACM Press 2004.
Dey, T. K., Sun, J.: An adaptive mls surface for reconstruction with guarantees. In: 3rd Eurographics Symp. on Geometry Processing, pp. 43–52 (2005).
S. Fleishman I. Drori D. Cohen-Or (2003) ArticleTitleBilateral mesh denoising ACM Trans. Graph. 22 IssueID3 950–953 Occurrence Handle10.1145/882262.882368
Jensen, H. W.: Global illumination using photon maps. In: Proc. 7th Eurographics Workshop on Rendering, pp. 21–30. Wien: Springer 1996.
T. R. Jones F. Durand M. Desbrun (2003) ArticleTitleNon-iterative, feature-preserving mesh smoothing ACM Trans. Graph. 22 IssueID3 943–949 Occurrence Handle10.1145/882262.882367
Kobbelt, L., Campagna, S., Vorsatz, J., Seidel, H.-P.: Interactive multi-resolution modeling on arbitrary meshes. In: SIGGRAPH '98, pp. 105–114. ACM Press 1998.
C. Lange K. Polthier (2005) ArticleTitleAnisotropic smoothing of point sets Comput. Aided Geom. Des. 22 680–692 Occurrence Handle02230191 Occurrence Handle10.1016/j.cagd.2005.06.010 Occurrence Handle2169055
D. Levin (1998) ArticleTitleThe approximation power of moving least-squares Math. Comput. 67 IssueID224 1517–1531 Occurrence Handle0911.41016 Occurrence Handle10.1090/S0025-5718-98-00974-0
Boris Mederos, L. V., de Figueiredo, L. H.: Robust smoothing of noisy point clouds. In: SIAM Conf. on Geometric Design and Computing 2003.
Y. Ohtake A. G. Belyaev I. Bogaevski (2001) ArticleTitleMesh regularization and adaptive smoothing Comput. Aided Des. 33 IssueID11 789–800 Occurrence Handle10.1016/S0010-4485(01)00095-1
Taubin, G.: A signal processing approach to fair surface design. In: SIGGRAPH '95, pp. 351–358. ACM Press 1995.
M. Vančo G. Brunnett (2004) ArticleTitleDirect segmentation of algebraic models for reverse engineering Computing 72 IssueID1–2 207–220 Occurrence Handle2098932
Vančo, M., Brunnett, G., Schreiber, T.: A hashing strategy for efficient k-nearest neighbors computation. In: CGI '99: Proc. Int. Conf. on Computer Graphics, pp. 120–127. IEEE Computer Society 1999.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Vančo, M., Brunnett, G. Geometric preprocessing of noisy point sets: an experimental study. Computing 79, 365–380 (2007). https://doi.org/10.1007/s00607-006-0212-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00607-006-0212-0