Streaming surface sampling using Gaussian ε-nets

Visual Computer

Volumn 25, Issue 5-7, 2009, Pages 411-421

  Pablo, Diaz Gutierrez ^a,b   Bösch, Jonas ^c   Pajarola, Renato ^c   Gopi, M ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Donald Bren Hall ^*  (United States)

^c UNIVERSITY OF ZURICH   (Switzerland)

Author keywords

Epsilon nets; Normal quantization; Shape approximation; Surface sampling

Indexed keywords

EPSILON-NETS; FEATURE PRESERVING; GAUSSIAN; GAUSSIAN SPHERES; GLOBAL INFORMATIONS; INPUT DATUM; NORMAL QUANTIZATION; SAMPLING ALGORITHMS; SAMPLING METHODS; SHAPE APPROXIMATION; SMALL MEMORY FOOTPRINTS; SURFACE SAMPLING;

LEARNING ALGORITHMS; PARALLEL ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 67349156408     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00371-009-0351-3     Document Type: Article

References (20)

1. F. Bernardini J. Mittleman H. Rushmeier C. Silva G. Taubin 1999 The ball-pivoting algorithm for surface reconstruction IEEE Trans. Vis. Comput. Graph. 5 4 349 359
2. Clarkson, K.L.: Building triangulations using ε-nets. In: SIGACT Symposium. ACM, New York (2006)
3. D. Cohen-Steiner P. Alliez M. Desbrun 2004 Variational shape approximation ACM Trans. Graph. 23 3 905 914 http://doi.acm.org/10.1145/1015706. 1015817
4. Dey, T.K.: Curve and Surface Reconstruction: Algorithms with Mathematical Analysis. Cambridge Monographs on Applied and Computational Mathematics. Cambridge University Press, Cambridge (2006).
5. Dong, W., Li, J., Kuo, J.: Fast mesh simplification for progressive transmission. In: Proceedings International Conference on Multimedia and Expo ICME 2000. IEEE Press, New York (2000)
6. Garland, M., Heckbert, P.S.: Surface simplification using quadric error metrics. In: Proceedings ACM SIGGRAPH, pp. 209-216. ACM, New York (1997)
7. M. Gopi S. Krishnan C. Silva 2000 Surface reconstruction using lower dimensional localized delaunay triangulation Eurographics 19 3 467 478
8. P.M. Gruber 2004 Optimum quantization and its applications Adv. Math. 186 456 497
9. Heckbert, P.S., Garland, M.: Survey of polygonal surface simplification algorithms. Tech. Rep., Computer Science Department, Carnegie Mellon University (1997)
10. Hoppe, H.: Progressive meshes. In: SIGGRAPH, pp. 99-108. ACM, New York (1996)
11. Isenburg, M., Lindstrom, P.: Streaming meshes. In: Proceedings IEEE Visualization, pp. 231-238 (2005)
12. D.P. Luebke 2001 A developer's survey of polygonal simplification algorithms IEEE Comput. Graph. Appl. 21 3 24 35
13. 2 approximation on triangulations. In: Chui, C.K., Schumaker, L.L., Ward, J.D. (eds.) Approximation Theory, pp. 499-502. Academic Press, San Diego (1986)
14. B. O'Neill 1997 Elementary Differential Geometry 2 Academic Press San Diego www.apnet.com O'Neill, B.: Elementary Differential Geometry, 2nd edn. Academic Press, San Diego (1997). www.apnet.com
15. Pajarola, R.: Stream-processing points. In: Proceedings IEEE Visualization, pp. 239-246 (2005)
16. H. Pottmann R. Krasauskas B. Hamann K. Joy W. Seibold 2000 On piecewise linear approximation of quadratic functions J. Geom. Graph. 4 1 31 53
17. A. Sheffer 2001 Model simplification for meshing using face clustering Comput. Aided Des. 33 925 934
18. M. Vetterli P. Marziliano T. Blu 2002 Sampling signals with finite rate of innovation IEEE Trans. Signal Proc. 50 6 1417 1428 10.1109/TSP.2002.1003065
19. K. Weiler 1985 Edge-based data structures for solid modeling in curved-surface environments IEEE Comput. Graph. Appl. 5 1 21 40
20. H. Yamauchi S. Gumhold R. Zayer H.P. Seidel 2005 Mesh segmentation driven by Gaussian curvature Vis. Comput. 21 8-10 649 658