Statistical geometry representation for efficient transmission and rendering

ACM Transactions on Graphics

Volumn 24, Issue 2, 2005, Pages 348-373

  Kalaiah, Aravind ^a,b   Varshney, Amitabh ^a,b  

^a UNIVERSITY OF MARYLAND   (United States)

^b University of Maryland ^*  (United States)

Author keywords

Network graphics; Point based rendering; Principal component analysis; Programmable GPU; Progressive transmission; Quasi random numbers; View dependent rendering

Indexed keywords

NETWORK GRAPHICS; POINT-BASED RENDERING; PROGRESSIVE TRANSMISSION; VIEW-DEPENDENT RENDERING;

COMPUTER GRAPHICS; DATA COMPRESSION; MATHEMATICAL MODELS; PERSONAL DIGITAL ASSISTANTS; PRINCIPAL COMPONENT ANALYSIS; STATISTICAL METHODS;

COMPUTATIONAL GEOMETRY;

EID: 33645795998     PISSN: 07300301     EISSN: 07300301     Source Type: Conference Proceeding    
DOI: 10.1145/1061347.1061356     Document Type: Article

References (57)

1. ALEXA, M., BEHR, J., COHEN-OR, D., FLEISHMAN, S., SILVA, C., AND LEVIN, D. 2001. Point set surfaces. In IEEE Visualization. 21-28.
2. ALLIEZ, P. AND DESBRUN, M. 2001. Progressive compression for lossless transmission of triangle meshes. In Proceedings of SIGGRAPH. ACM Press, 195-202.
3. AMENTA, N., BERN, M., AND KAMVYSSELIS, M. 1998. A New Voronoi-Based Surface Reconstruction Algorithm. In Proceedings of SIGGRAPH. ACM Press. 415-422.
4. BOTSCH, M. AND KOBBELT, L. 2003. High-Quality Point-Based Rendering on Modern GPUs. In Proceedings of Pacific Graphics. 335-346.
5. BOTSCH, M., WIRATANAYA, A., AND KOBBELT, L. 2002. Efficient high quality rendering of point sampled geometry. In Rendering Techniques. Eurographics, 53-64.
6. Box, G. E. P. AND MULLER, M. E. 1958. A note on the generation of random normal deviates. Ann. Math. Stat. 28, 610-611.
7. BRODSKY, D. AND WATSON, B. 2000. Model simplification through refinement. In Proceedings of Graphics Interface. 221-228.
8. Buss, S. R. AND FILLMORE, J. P. 2001. Spherical averages and applications to spherical splines and interpolation. ACM Trans. Graph. 20, 2, 95-126.
9. CHEN, B. AND NGUYEN, M. X. 2001. POP: A hybrid point and polygon rendering system for large data. In IEEE Visualization. 45-52.
10. COHEN-OR, D., LEVIN, D., AND REMEZ, O. 1999. Progressive compression of arbitrary triangular meshes. In IEEE Visualization. 67-72.
11. DACHSBACHER, C., VOGELGSANG, C., AND STAMMINGER, M. 2003. Sequential point trees. ACM Trans. Graph. 22, 3, 657-662.
12. DEERING, M. F. 1995. Geometry compression. In Proceedings of SIGGRAPH. ACM Press, 13-20.
13. DY, T. K. AND HUDSON, J. 2002. PMR: Point to Mesh Rendering, A Feature-Based Approach. In IEEE Visualization. 155-162.
14. DUDA, R. O., HART, P. E., AND STORK, D. G. 2001. Pattern Classification 2nd Ed. John Wiley & Sons, Inc., New York.
15. EBERT, D., MUSGRAVE, F., PEACHEY, P., PERLIN, K., AND WORLEY, S. 2002. Texturing and Modeling: A Procedural Approach, 3rd Ed. AP Professional, San Diego.
16. FLEISHMAN, S., COHEN-OR, D., ALEXA, M., AND SILVA, C. T. 2003. Progressive point set surfaces. ACM Trans. Graph. 22, 4, 997-1011.
17. GANDOIN, P.-M. AND DEVILLERS, O. 2002. Progressive lossless compression of arbitrary simplicial complexes. ACM Trans. Graph. 21, 372-379.
18. GROSSMAN, J. P. AND DALLY, W. J. 1998. Point sample rendering. In Rendering Techniques. Eurographics. Springer-Verlag New York, 181-192.
19. GUENNEBAUD, G., BARTHE, L., AND PAULIN, M. 2004. Deferred splatting. Comput. Graph. For. 23, 3, 653-660.
20. GUENNEBAUD, P. AND PAULIN, M. 2003. Efficient screen space approach for hardware accelerated surfel rendering. In 8th Fall Workshop on Vision, Modeling, and Visualization. 485-493.
21. HUMPHREYS, G., HOUSTON, M., NG, R., FRANK, R., AHERN, S., KIRCHNER, P. D., AND KLOSOWSKI, J. T. 2002. Chromium: A stream-processing framework for interactive rendering on clusters. ACM Trans. Graph. 21, 3 (July), 693-702.
22. ISENBURG, M. AND SNOEYINK, J. 2000. Face fixer: Compressing polygon meshes with properties. In Proceedings of SIGGRAPH. ACM Press, 263-270.
23. JOHNSON, C. AND SANDERSON, A. 2003. A next step: Visualizing errors and uncertainty. IEEE Comput. Graph. Appl. 23, 5 (Sept.), 6-10.
24. KALAIAH, A. AND VARSHNEY, A. 2003a. Modeling and rendering points with local geometry. IEEE Trans. Visual. Comput. Graph. 9, 1 (Jan.), 30-42.
25. KALAIAH, A. AND VARSHNEY, A. 2003b. Statistical point geometry. In Eurographics Symposium on Geometry Processing. 113-122.
26. KARNI, Z. AND GOTSMAN, C. 2000. Spectral compression of mesh geometry. In Proceedings of SIGGRAPH. ACM Press, 279-286.
27. KELLER, A. 1996. Quasi-Monte Carlo Methods in Computer Graphics: The Global Illumination Problem. In Lectures in Applied Mathematics. Vol. 32. SIAM, 455-469.
28. KHODAKOVSKY, A., SCHRÖDER, P., AND SWELDENS, W. 2000. Progressive geometry compression. In Proceedings of SIGGRAPH. ACM Press, 271-278.
29. KUMAR, S., MANOCHA, D., GARRETT, W., AND LIN, M. 1996. Hierarchical back-face computation. In Rendering Techniques. Eurographics. Springer-Verlag, New York, 231-240.
30. LEVOY, M. AND WHITTED, T. 1985. The use of points as a display primitive. In Tech. Rep. 85-022, Computer Science Department, University of North Carolina, Chapel Hill.
31. MARSAGLIA, G. 1972. Choosing a point from the surface of a sphere. Ann. Math. Stat. 43, 2 (April), 645-646.
32. NIEDERREITER, H. 1992. Random Number Generation and Quasi-Monte Carlo Methods. In CBMS-NSF Regional Conference Series in Applied Mathematics. Vol. 63. SIAM.
33. PAJAROLA, R. 2003. Efficient level-of-details for point based rendering. In Proceedings IASTED Computer Graphics and Imaging Conference (CGIM).
34. PAULY, M. AND GROSS, M. 2001. Spectral processing of point-sampled geometry. In Proceedings of SIGGRAPH. ACM Press, 379-386.
35. PAULY, M., GROSS, M., AND KOBBELT, L. P. 2002. Efficient simplification of point-sampled surfaces. In IEEE Visualization. 163-170.
36. PAULY, M., KEISER, R., KOBBELT, L. P., AND GROSS, M. 2003. Shape modeling with point-sampled geometry. ACM Trans. Graph. 22, 3 (July), 641-650.
37. PFISTER, H., ZWICKER, M., VAN BAAR, J., AND GROSS, M. 2000. Surfels: Surface elements as rendering primitives. In Proceedings of SIGGRAPH. ACM Press, 335-342.
38. PRAUN, E. AND HOPPE, H. 2003. Spherical parametrization and remeshing. ACM Trans. Graph. 22, 3 (July), 340-349.
39. PRESS, W. H., FLANNERY, B. P., TEUKOLSKY, S. A., AND VETTERLING, W. T. 2003. Numerical Recipes in C: The Art of Scientific Computing 2nd Ed. Cambridge University Press.
40. PRESS, W. H. AND TEUKOLSKY, S. A. 1989. Quasi- (that is, sub-) random numbers. Comput. Physics 3, 6, 76-79.
41. REEVES, W. T. 1983. Particle systems - A technique for modeling a class of fuzzy objects. Comput. Graph. 17, 3 (July), 359-376.
42. REN, L., PFISTER, H., AND ZWICKER, M. 2002. Object space EWA surface splatting: A hardware accelerated approach to high quality point rendering. Comput. Graph. For. 21, 3, 461-470.
43. RITTER, J. 1990. Fast 2D-3D Rotation. In Graphics Gems. A. Glassner, Ed. Academic Press, Boston, MA, 440-441.
44. RUSINKIEWICZ, S. AND LEVOY, M. 2000. QSplat: A multiresolution point rendering system for large meshes. In Proceedings of SIGGRAPH. ACM Press, 343-352.
45. SAMET, H. 1990. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA.
46. SCHILLING, A. 2001. Antialiasing of environment maps. Comput. Graph. For. 20, 1, 5-11.
47. TAUBIN, G., GUEZIEC, A., HORN, W., AND LAZARUS, F. 1998. Progressive forest split compression. In Proceedings of SIGGRAPH. ACM Press, 123-132.
48. TAUBIN, G. AND ROSSIGNAC, J. 1998. Geometric compression through topological surgery. ACM Trans. Graph. 17, 2 (April), 84-115.
49. TOUMA, C. AND GOTSMAN, C. 1998. Triangle mesh compression. In Graph. Interf. 26-34.
50. WAND, M., FISCHER, M., PETER, I., HEIDE, F. M., AND STRASSER, W. 2001. The randomized z-buffer algorithm: Interactive rendering of highly complex scenes. In Proceedings of SIGGRAPH. ACM Press, 361-370.
51. WELSH, T. AND MUELLER, K. 2003. A frequency-sensitive point hierarchy for images and volumes. In IEEE Visualization. 425-432.
52. WONG, T.-T., Lux, W.-S., AND HENG, P.-A. 1997. Sampling with hammersley and halton points. J. Graph. Tools 2, 2, 9-24.
53. WOOLLEY, J. C., LUEBKE, D., AND WATSON, B. 2002. Interruptible rendering. In SIGGRAPH Technical Sketch. ACM Press, 205.
54. Wu, J. AND KOBBELT, L. 2004. Optimized sub-sampling of point sets for surface splatting. Comput. Graph. For. 23, 3, 643-652.
55. WULF, W. A. AND MCKEE, S. A. 1995. Hitting the memory wall: Implications of the obvious. Comput. Architect. News 23, 1 (March), 20-24.
56. ZWICKER, M. 2004. Hardware accelerated point-based rendering. Available at http://courses.dce.harvard.edu/cscie236/lecture11/11.Point-Rendering-Zwicker. pdf. 1-28.
57. ZWICKER, M., PFISTER, H., VAN BAAR, J., AND GROSS, M. 2001. Surface splatting. In Proceedings of SIGGRAPH. ACM Press, 371-378.