Stream-processing points

With the growing size of captured 3D models it has become increasingly important to provide basic efficient processing methods for large unorganized raw surface-sample point data sets. In this paper we introduce a novel stream-based (and out-of-core) point processing framework. The proposed approach processes points in an orderly sequential way by sorting them and sweeping along a spatial dimension. The major advantages of this new concept are: (1) support of extensible and concatenate local operators called stream operators, (2) low main-memory usage and (3) applicability to process very large data sets out-of-core.

[1]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..

[2]  Martin Isenburg,et al.  Large mesh simplification using processing sequences , 2003, IEEE Visualization, 2003. VIS 2003..

[3]  Bettina Speckmann,et al.  Bounds on the k-Neighborhood for Locally Uniformly Sampled Surfaces , 2004, PBG.

[4]  Marc Levoy,et al.  The Use of Points as a Display Primitive , 2000 .

[5]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[6]  William J. Dally,et al.  Point Sample Rendering , 1998, Rendering Techniques.

[7]  Matthias Zwicker,et al.  Surfels: surface elements as rendering primitives , 2000, SIGGRAPH.

[8]  Martin Rumpf,et al.  Anisotropic geometric diffusion in surface processing , 2000 .

[9]  Frédo Durand,et al.  Normal improvement for point rendering , 2004, IEEE Computer Graphics and Applications.

[10]  Renato Pajarola,et al.  Efficient Level-of-details for Point based Rendering , 2003, Computer Graphics and Imaging.

[11]  Han Tong Loh,et al.  Adaptive fairing of digitized point data with discrete curvature , 2002, Comput. Aided Des..

[12]  Leif Kobbelt,et al.  High-quality point-based rendering on modern GPUs , 2003, 11th Pacific Conference onComputer Graphics and Applications, 2003. Proceedings..

[13]  Martin Isenburg,et al.  Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..

[14]  Mark Meyer,et al.  Implicit fairing of irregular meshes using diffusion and curvature flow , 1999, SIGGRAPH.

[15]  Markus H. Gross,et al.  Spectral processing of point-sampled geometry , 2001, SIGGRAPH.

[16]  Renato Pajarola,et al.  Point-based rendering techniques , 2004, Comput. Graph..

[17]  Gabriel Taubin,et al.  A signal processing approach to fair surface design , 1995, SIGGRAPH.

[18]  Niloy J. Mitra,et al.  Estimating surface normals in noisy point cloud data , 2003, SCG '03.

[19]  Frédo Durand,et al.  Non-iterative, feature-preserving mesh smoothing , 2003, ACM Trans. Graph..

[20]  Amitabh Varshney,et al.  Modeling and Rendering of Points with Local Geometry , 2003, IEEE Trans. Vis. Comput. Graph..

[21]  Renato Pajarola,et al.  Points Reloaded: Point-Based Rendering Revisited , 2004, PBG.

[22]  Tamal K. Dey,et al.  Delaunay based shape reconstruction from large data , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[23]  Markus H. Gross,et al.  Efficient simplification of point-sampled surfaces , 2002, IEEE Visualization, 2002. VIS 2002..

[24]  Marc Alexa,et al.  Point set surfaces , 2001, Proceedings Visualization, 2001. VIS '01..

[25]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[26]  Tamal K. Dey,et al.  PMR: point to mesh rendering, a feature-based approach , 2002, IEEE Visualization, 2002. VIS 2002..

[27]  Tony DeRose,et al.  Surface reconstruction from unorganized points , 1992, SIGGRAPH.

[28]  Meenakshisundaram Gopi,et al.  Surface Reconstruction based on Lower Dimensional Localized Delaunay Triangulation , 2000, Comput. Graph. Forum.

[29]  Peter J. Denning.  Virtual Memory , 1996, ACM Comput. Surv..

[30]  Marc Stamminger,et al.  Sequential point trees , 2003, ACM Trans. Graph..

[31]  Matthias Zwicker,et al.  Object Space EWA Surface Splatting: A Hardware Accelerated Approach to High Quality Point Rendering , 2002, Comput. Graph. Forum.

[32]  Martin Isenburg,et al.  Out-of-core compression for gigantic polygon meshes , 2003, ACM Trans. Graph..

[33]  Leif Kobbelt,et al.  A Stream Algorithm for the Decimation of Massive Meshes , 2003, Graphics Interface.

[34]  Leif Kobbelt,et al.  Efficient High Quality Rendering of Point Sampled Geometry , 2002, Rendering Techniques.

[35]  Renato Pajarola,et al.  Confetti: object-space point blending and splatting , 2004, IEEE Transactions on Visualization and Computer Graphics.

[36]  Tim Weyrich,et al.  Post-processing of Scanned 3D Surface Data , 2004, PBG.

[37]  Leif Kobbelt,et al.  Geometric fairing of irregular meshes for free-form surface design , 2001, Comput. Aided Geom. Des..

[38]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[39]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .