This Article 
 Bibliographic References 
 Add to: 
Computing and Rendering Point Set Surfaces
January-March 2003 (vol. 9 no. 1)
pp. 3-15

Abstract—We advocate the use of point sets to represent shapes. We provide a definition of a smooth manifold surface from a set of points close to the original surface. The definition is based on local maps from differential geometry, which are approximated by the method of moving least squares (MLS). The computation of points on the surface is local, which results in an out-of-core technique that can handle any point set. We show that the approximation error is bounded and present tools to increase or decrease the density of the points, thus allowing an adjustment of the spacing among the points to control the error. To display the point set surface, we introduce a novel point rendering technique. The idea is to evaluate the local maps according to the image resolution. This results in high quality shading effects and smooth silhouettes at interactive frame rates.

[1] M. Alexa, J. Behr, D. Cohen-Or, S. Fleishman, D. Levin, and C.T. Silva, “Point Set Surfaces,” Proc. IEEE Visualization 2001, pp. 21-28, Oct. 2001.
[2] N. Amenta, M. Bern, and M. Kamvysselis, “A New Voronoi-Based Surface Reconstruction Algorithm,” Proc. SIGGRAPH '98, pp. 415-422, July 1998.
[3] C.L. Bajaj, F. Bernardini, and G. Xu, “Automatic Reconstruction of Surfaces and Scalar Fields from 3D Scans,” Proc. SIGGRAPH '95, pp. 109-118, Aug. 1995.
[4] J. Barnes and P. Hut, “A Hierarchical O(N log N) Force Calculation Algorithm,” Nature, vol. 324, pp. 446-449, Dec. 1986.
[5] F. Bernardini, J. Mittleman, H. Rushmeier, C. Silva, and G. Taubin, “The Ball-Pivoting Algorithm for Surface Reconstruction,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 4, pp. 349-359, Oct.-Dec. 1999.
[6] P. Besl and N. McKay, “A Method for Registration of 3-D Shapes,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[7] J.-D. Boissonnat, “Geometric Structues for Three-Dimensional Shape Representation,” ACM Trans. Graphics, vol. 3, no. 4, pp. 266-286, Oct. 1984.
[8] B. Chen and M.X. Nguyen, “Pop: A Hybrid Point and Polygon Rendering System for Large Data,” Proc. IEEE Visualization 2001, pp. 45-52, Oct. 2001.
[9] P. Cignoni, C. Montani, and R. Scopigno, “A Comparison of Mesh Simplification Algorithms,” Computers & Graphics, vol. 22, no. 1, pp. 37-54, Feb. 1998.
[10] J.D. Cohen, D.G. Aliaga, and W. Zhang, “Hybrid Simplification: Combining Multi-Resolution Polygon and Point Rendering,” Proc. IEEE Visualization 2001, pp. 37-44, Oct. 2001.
[11] P. Crossno and E. Angel, “Isosurface Extraction Using Particle Systems,” Proc. IEEE Visualization '97, pp. 495-498, Nov. 1997.
[12] B. Curless and M. Levoy, “A Volumetric Method for Building Complex Models from Range Images,” Proc. SIGGRAPH '96. pp. 303-312, Aug. 1996.
[13] L.H. de Figueiredo, J. de Miranda Gomes, D. Terzopoulos, and L. Velho, “Physically-Based Methods for Polygonization of Implicit Surfaces,” Proc. Graphics Interface '92, pp. 250-257, May 1992.
[14] M. Desbrun, M. Meyer, P. Schröder, and A.H. Barr, “Implicit Fairing of Irregular Meshes Using Diffusion and Curvature Flow,” Proc. SIGGRAPH '99, pp. 317-324, Aug. 1999.
[15] L.D. Floriani, P. Magillo, and E. Puppo, “Building and Traversing a Surface at Variable Resolution,” Proc. IEEE Visualization '97, pp. 103-110, Nov. 1997.
[16] L.D. Floriani, P. Magillo, and E. Puppo, “Efficient Implementation of Multi-Triangulations,” Proc. IEEE Visualization '98, pp. 43-50, Oct. 1998.
[17] M. Gopi, S. Krishnan, and C.T. Silva, “Surface Reconstruction Based on Lower Dimensional Localized Delaunay Triangulation,” Computer Graphics Forum, vol. 19, no. 3, Aug. 2000.
[18] A. Goshtasby and W.D. O'Neill, “Surface Fitting to Scattered Data by a Sum of Gaussians,” Computer Aided Geometric Design, vol. 10, no. 2, pp. 143-156, Apr. 1993.
[19] J.P. Grossman and W.J. Dally, “Point Sample Rendering,” Proc. Eurographics Rendering Workshop 1998, pp. 181-192, June 1998.
[20] A.P. Gueziec, G. Taubin, F. Lazarus, and W. Horn, “Converting Sets of Polygons to Manifold Surfaces by Cutting and Stitching,” Proc. IEEE Visualization '98, pp. 383-390, Oct. 1998.
[21] P. Hebert, D. Laurendeau, and D. Poussart, “Scene Reconstruction and Description: Geometric Primitive Extraction from Multiple View Scattered Data,” Proc. IEEE Computer Vision and Pattern Recognition 1993, pp. 286-292, 1993.
[22] H. Hoppe, T. DeRose, T. Duchamp, M. Halstead, H. Jin, J. McDonald, J. Schweitzer, and W. Stuetzle, “Piecewise Smooth Surface Reconstruction,” Proc. SIGGRAPH '94, pp. 295-302, July 1994.
[23] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Surface Reconstruction from Unorganized Points,” Computer Graphics (Proc. SIGGRAPH '92), vol. 26, no. 2, pp. 71-78, July 1992.
[24] H. Hoppe, T. DeRose, T. Duchamp, J. McDonald, and W. Stuetzle, “Mesh Optimization,” Proc. SIGGRAPH '93, pp. 19-26, Aug. 1993.
[25] A. Kalaiah and A. Varshney, “Differential Point Rendering,” Rendering Techniques 2001: Proc. 12th Eurographics Workshop Rendering, pp. 139-150, June 2001.
[26] A. Kaufman, D. Cohen, and R. Yagel, “Volume Graphics,” Computer, vol. 26, no. 7, pp. 51-64, July 1993.
[27] L.P. Kobbelt, T. Bareuther, and H.-P. Seidel, “Multiresolution Shape Deformations for Meshes with Dynamic Vertex Connectivity,” Computer Graphics Forum, vol. 19, no. 3, pp. 249-259, Aug. 2000.
[28] V. Krishnamurthy and M. Levoy, “Fitting Smooth Surfaces to Dense Polygon Meshes,” Proc. SIGGRAPH '96, pp. 313-324, Aug. 1996.
[29] S. Kumar, D. Manocha, W. Garrett, and M. Lin, “Hierarchical Back-Face Computation,” Proc. Eurographics Rendering Workshop 1996, X. Pueyo and P. Schröder, eds., pp. 235-244, June 1996.
[30] I.-K. Lee, “Curve Reconstruction from Unorganized Points,” Computer Aided Geometric Design, vol. 17, no. 2, pp. 161-177, Feb. 2000.
[31] Z. Lei, M.M. Blane, and D.B. Cooper, “3L Fitting of Higher Degree Implicit Polynomials,” Proc. Third IEEE Workshop Applications of Computer Vision, Dec. 1996.
[32] D. Levin, “The Approximation Power of Moving Least-Squares,” Math. Computation, vol. 67, no. 224, 1998.
[33] D. Levin, “Mesh-Independent Surface Interpolation,” Advances in Computational Math., 2001.
[34] M. Levoy, K. Pulli, B. Curless, S. Rusinkiewicz, D. Koller, L. Pereira, M. Ginzton, S. Anderson, J. Davis, J. Ginsberg, J. Shade, and D. Fulk, “The Digital Michelangelo Project: 3D Scanning of Large Statues,” Proc. SIGGRAPH 2000, pp. 131-144, July 2000.
[35] M. Levoy and T. Whitted, “The Use of Points as a Display Primitive,” Tr 85-022, Univ. of North Carolina at Chapel Hill, 1985.
[36] L. Linsen, “Point Cloud Representation,” technical report, Fakultät fuer Informatik, Universität Karlsruhe, 2001.
[37] S.P. Lloyd, “Least Squares Quantization in PCM,” IEEE Trans. Information Theory, vol. 28, pp. 128-137, 1982.
[38] D. Marr, Vision: A Computational Investigation into the Human Representation and Processing of Visual Information. W.H. Freeman, Sept. 1983.
[39] D.K. McAllister, L.F. Nyland, V. Popescu, A. Lastra, and C. McCue, “Real-Time Rendering of Real-World Environments,” Proc. Eurographics Rendering Workshop 1999, June 1999.
[40] A. Okabe, B. Boots, and K. Sugihara, Spatial TesselationsConcepts and Applications of Voronoi Diagrams. Chichester: Wiley, 1992.
[41] H. Pfister, M. Zwicker, J. van Baar, and M. Gross, “Surfels: Surface Elements as Rendering Primitives,” Proc. SIGGRAPH 2000, pp. 335-342, July 2000.
[42] V. Pratt, “Direct Least-Squares Fitting of Algebraic Surfaces,” Computer Graphics (Proc. SIGGRAPH '87), vol. 21, no. 4, pp. 145-152, July 1987.
[43] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, second ed. Cambridge Univ. Press, 1992.
[44] R. Ramamoorthi and J. Arvo, “Creating Generative Models from Range Images,” Proc. SIGGRAPH '99, pp. 195-204, Aug. 1999.
[45] S. Runsinkiewicz and M. Levoy, “Streaming qsplat: A Viewer for Networked Visualization of Large, Dense Models,” Proc. Symp. Interactive 3D Graphics, 2001.
[46] S. Rusinkiewicz and M. Levoy, “Qsplat: A Multiresolution Point Rendering System for Large Meshes,” Proc. SIGGRAPH 2000, pp. 343-352, July 2000.
[47] M. Rutishauser, M. Stricker, and M. Trobina, “Merging Range Images of Arbitrarily Shaped Objects,” Proc. IEEE Computer Vision and Pattern Recognition 1994, pp. 573-580, 1994.
[48] G. Schaufler and H.W. Jensen, “Ray Tracing Point Sampled Geometry,” Rendering Techniques 2000: Proc. 11th Eurographics Workshop on Rendering, pp. 319-328, June 2000.
[49] M. Soucy and D. Laurendeau, “Surface Modeling from Dynamic Integration of Multiple Range Views,” Proc. 1992 Int'l Conf. Pattern Recognition, pp. I:449-452, 1992.
[50] M. Sramek and A.E. Kaufman, “Alias-Free Voxelization of Geometric Objects,” IEEE Trans. Visualization and Computer Graphics, vol. 5, no. 3, pp. 251-267, July-Sept. 1999.
[51] G. Taubin, “A Signal Processing Approach to Fair Surface Design,” Proc. SIGGRAPH '95, pp. 351-358, Aug. 1995.
[52] G. Turk, “Re-Tiling Polygonal Surfaces,” Computer Graphics (Proc. SIGGRAPH '92), vol. 26, no. 2, pp. 55-64, July 1992.
[53] G. Turk and M. Levoy, “Zippered Polygon Meshes from Range Images,” Proc. SIGGRAPH '94, pp. 311-318, July 1994.
[54] S.W. Wang and A.E. Kaufman, “Volume Sculpting,” Proc. 1995 Symp. Interactive 3D Graphics, pp. 151-156, Apr. 1995.
[55] M. Wheeler, Y. Sato, and K. Ikeuchi, “Consensus Surfaces for Modeling 3D Objects from Multiple Range Images,” Proc. IEEE Int'l Conf. Computer Vision 1998, pp. 917-924, 1998.
[56] A.P. Witkin and P.S. Heckbert, “Using Particles to Sample and Control Implicit Surfaces,” Proc. SIGGRAPH '94, pp. 269-278, July 1994.

Index Terms:
Surface representation and reconstruction, moving least squares, point sample rendering, 3D acquisition.
Marc Alexa, Johannes Behr, Daniel Cohen-Or, Shachar Fleishman, David Levin, Claudio T. Silva, "Computing and Rendering Point Set Surfaces," IEEE Transactions on Visualization and Computer Graphics, vol. 9, no. 1, pp. 3-15, Jan.-March 2003, doi:10.1109/TVCG.2003.1175093
Usage of this product signifies your acceptance of the Terms of Use.