Visibility of noisy point cloud data

Computers and Graphics (Pergamon)

Volumn 34, Issue 3, 2010, Pages 219-230

  Mehra, Ravish ^a,b   Tripathi, Pushkar ^a,c   Sheffer, Alla ^d   Mitra, Niloy J ^a,e  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^e KING ABDULLAH UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Saudi Arabia)

Author keywords

Computer graphics; Line and curve generation; Noise smoothing; Point cloud; Surface reconstruction; Visibility

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER GRAPHICS; CURVE FITTING; GEOMETRY; GRAPHIC METHODS; REPAIR; SURFACE RECONSTRUCTION;

CONSISTENT RECONSTRUCTION; GRAPH-BASED; LINE AND CURVE GENERATION; NOISE SMOOTHING; POINT CLOUD; ROBUST ALGORITHM; THEORETICAL BOUNDS; VISIBILITY ESTIMATION;

VISIBILITY;

EID: 77955271112     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cag.2010.03.002     Document Type: Conference Paper

References (36)

1. Alexa M, Behr J, Cohen-Or D, Fleishman S, Levin D, Silva CT. Point set surfaces. In: VIS '01: proceedings of the conference on visualization '01, IEEE Computer Society. Washington, DC, USA, 2001. p. 21-8.
2. Amenta N, Bern M, Eppstein D. The crust and the beta-skeleton: combinatorial curve reconstruction. In: Graphical models and image processing, 1998. p. 125-35.
3. N. Amenta, S. Choi, and R. Krishna Kolluri The power crust, unions of balls, and the medial axis transform Comput Geometry Theory Appl 19 2000 127 153
4. N. Amenta, and Y. Joo Kil Defining point-set surfaces ACM Trans Graph 23 3 2004 264 270
5. Appel A. Some techniques for shading machine renderings of solids. In: AFIPS spring joint computer conference, vol. 32, 1968. p. 3745.
6. Arya S, Mount DM. Approximate nearest neighbor queries in fixed dimensions. In: SODA '93: proceedings of the fourth annual ACM-SIAM symposium on discrete algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1993. p. 271-80.
7. J. Bittner, and P. Wonka Visibility in computer graphics Environ Plann B Plann Des 30 5 2003 729 755
8. Catmull EE. A subdivision algorithm for computer display of curved surfaces. PhD thesis, 1974.
9. T.T. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to algorithms 1990 MIT Press Cambridge, MA, USA
10. Davis J, Marschner SR, Garr M, Levoy M. Filling holes in complex surfaces using volumetric diffusion. In: first international symposium on 3D data processing, visualization, and transmission, 2001. p. 428-38.
11. T. Dey Curve and surface reconstruction: algorithms with mathematical analysis 2006 Cambridge University Press New York, NY, USA
12. Dey TK, Giesen J. Detecting undersampling in surface reconstruction. In: SCG '01: proceedings of the seventeenth annual symposium on computational geometry, 2001. p. 257-63.
13. Dey TK, Goswami S. Tight cocone: a water-tight surface reconstructor. In: SM '03: proceedings of the eighth ACM symposium on solid modeling and applications, ACM, New York, NY, USA, 2003. p. 127-34.
14. Dey TK, Goswami S. Provable surface reconstruction from noisy samples. In: SCG '04: proceedings of the twentieth annual symposium on Computational geometry. ACM, New York, NY, USA, 2004. p. 33039.
15. T.K. Dey, and S. Goswami Provable surface reconstruction from noisy samples Comput Geom Theory Appl 35 1 2006 124 141
16. Dey TK, Mehlhorn K, Ramos EA. Curve reconstruction: connecting dots with good reason. In: SCG '99: proceedings of the fifteenth annual symposium on Computational geometry. ACM, New York, NY, USA, 1999. p. 197-206.
17. Dey TK, Sun J. An adaptive mls surface for reconstruction with guarantees. In: SGP '05: proceedings of the third eurographics symposium on geometry processing. Eurographics Association, Aire-la-Ville, Switzerland, 2005. p. 43.
18. Dey TK, Sun J. An adaptive mls surface for reconstruction with guarantees. In: SGP '05: proceedings of the third eurographics symposium on geometry processing, Eurographics Association. Aire-la-Ville, Switzerland, 2005. p. 43.
19. T.K. Dey, and R. Wenger Fast reconstruction of curves with sharp corners Int J Comput Geometry Appl 12 5 2002 353 400
20. Francke A, Hoffmann M. The euclidean degree-4 minimum spanning tree problem is np-hard. In: SCG '09: proceedings of the 25th annual symposium on computational geometry. ACM, New York, NY, USA, 2009. p. 179-188.
21. M.R. Garey, and D.S. Johnson Computers and intractability: a guide to the theory of np-completeness (series of books in the mathematical sciences) 1979 W.H. Freeman New York, NY, USA
22. Gross M, Pfister H, editors. Point-based graphics. Elsevier Science and Technology Books, 2007.
23. Hoppe H, Derose T, Duchamp T, McDonald JA, Stuetzle W. Surface reconstruction from unorganized points, 1992.
24. H. Huang, D. Li, H. Zhang, U. Ascher, and D. Cohen-Or Consolidation of unorganized point clouds for surface reconstruction ACM Trans Graphics 28 5 2009 to appear.
25. R.M. Karp Reducibility among combinatorial problems R.E. Miller, J.W. Thatcher, Complexity of Computer Computations 1972 Plenum Press New York, NY, USA 85 103
26. Katz S, Tal A, Basri R. Direct visibility of point sets. In: SIGGRAPH '07: ACM SIGGRAPH 2007 papers. ACM, New York, NY, USA, 2007. p. 24.
27. Kazhdan M, Bolitho M, Hoppe H. Poisson surface reconstruction. In: SGP '06: proceedings of the fourth eurographics symposium on geometry processing. Eurographics Association, Aire-la-Ville, Switzerland, 2006. p. 61-70.
28. D. Levin The approximation power of moving least-squares Math Comput 67 224 1998 1517 1531 (Pubitemid 128383317)
29. Mederos B, Amenta N, Velho L, Henrique de Figueiredo L. Surface reconstruction from noisy point clouds. In: SGP '05: proceedings of the third eurographics symposium on geometry processing. Eurographics Association, Aire-la-Ville, Switzerland, 2005. p. 53.
30. Vollmer J, Mencl, R. Muller H. Improved laplacian smoothing of noisy surface meshes, 1999.
31. Mitra NJ, Flory S, Ovsjanikov M, Gelfand N, Guibas L, Pottmann H. Dynamic geometry registration. In: Symposium on geometry processing, 2007. p. 173-82.
32. Mitra NJ, Nguyen A, Guibas L. Estimating surface normals in noisy point cloud data. Int J Comput Geometry Appl 2004;14: 261-76. (special issue)
33. M. Pauly, L.P. Kobbelt, and M. Gross Point-based multiscale surface representation ACM Trans Graph 25 2 2006 177 193
34. Pauly M, Mitra NJ, Guibas L. Uncertainty and variability in point cloud surface data. In: Symposium on point-based graphics, 2004.
35. Schnelle Kurven Straer Wolfgang. Flchendarstellung auf graphischen Sichtgerten. PhD thesis, 1974.
36. I.E. Sutherland, R.F. Sproull, Robert, and A. Schumacker A characterization of ten hidden-surface algorithms ACM Comput Surv 6 1974 1 55