Hardware-assisted computation of depth contours

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 558-567

  Krishnan, Shankar ^a   Mustafa, Nabu H ^b   Venkatasubramanian, Suresh ^a  

^a AT AND T LABS RESEARCH   (United States)

^b Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC GROWTH; DEPTH VALUE; GEOMETRIC DESCRIPTION; GRAPHICS ARCHITECTURE; HALF-PLANES; HARDWARE-ASSISTED; LOCATION DEPTHS;

ALGORITHMS;

EID: 84968735331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Bäsch, J., Guibas, L., and Hershberger, J. Data structures for mobile data. In Proc. 8th ACM-S1AM Sympos. Discrete Algorithms (1997), pp. 747-756.
2. Cole, R., Sharir, M., and Yap, C. K. On k-hulls and related problems. SIAM Journal on Computing 15, 1 (1987), 61-77.
3. Duca, K. Personal communication.
4. Goldfeather, J., Molnar, S., Turk, G., and Fuchs, H. Near real-time CSG rendering using tree normalization and geometric pruning. IEEE Computer Graphics and Applications 9, 3 (1989), 20-28.
5. Goodrich, M., Guibas, L., Hershberger, J., and Tanenbaum, P. Snap rounding line segments efficiently in two and three dimensions. In Proc. 13th ACM Symp. on Computational Geometry (1997), pp. 284-293.
6. Greene, D., and Yao, F. F. Finite resolution computational geometry. In Proc. 27th IEEE Symp. Foundations of Computer Science (1986), pp. 163-172.
7. Greene, N.. and Kass, M. Hierarchical Z-buffer visibility. In Proc. ACM SIGGRAPH (1993), pp. 231-238.
8. Guibas, L., and Marimont, D. Rounding arrangements dynamically. Internat. J. Comput. Geom Appl. 8 (1998), 157-176.
9. Hobby, J. Practical segment intersection with finite precision output Technical Report 93/2-27, Bell Laboratories, 1993.
10. Hodges, J. A bivariate sign test. Annals of Mathematical Statistics 26 (1955), 523-527.
11. Hoff, III, K. E., Culver, T., Keyser, J., Lin, M., and Manocha, D. Fast computation of generalized Voronoi diagrams using graphics hardware. In Proc. ACM SIGGRAPH (1999), pp. 277-286.
12. Hoff, III, K. E., Culver, T., Keyser, J., Lin, M., and Manocha, D. Interactive motion planning using hardware-accelerated computation of generalized voronoi diagrams. In Proc. IEEE International Conference on Robotics and Automation (2000), pp. 2931-2937.
13. Krishnan, S., Silva, C, and Wei, B. A hardware-assisted visibility-ordering algorithm with applica tions to volume rendering. In Data Visualization (2001), pp. 233-242.
14. Lindholm, E., Kilgard, M. J., and Moreton, H. A user-programmable vertex engine. In ACAf SIGGRAPH, p. 149.
15. Matousek, i. Computing the center of planar point sets. DIMACS Series in Discrete Mathematics and Computer Scienceo (1991), 221-230.
16. Milenkovic, V. Shortest path geometric rounding. Algo-rithmica 27, 1 (2000), 57-86.
17. Miller, k., Ramaswami, S., Rousseeuw, P., Sell-ares, T., souvaine, D., strejnu, l, and struyf, A. Fast implementation of depth contours using topological sweep. In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms (2001), pp. 690-699.
18. Mustafa, N., Koutsofios, E., Krishnan, S., and Venkatasubramanian, S. Hardware-assisted view-dependent map simplification. In Proc. 17th ACM Symp. on Computational Geometry (2001), pp. 50-59.
19. Peercy, M. S., Olano, M., Airey, J., and Ungar, P. J. Interactive multi-pass programmable shading. In ACM S1GGRAPH, p. 425.
20. rossignac, J., and Requicha, A. Depth-buffering display techniques for constructive solid geometry. IEEE Computer Graphics and Applications 6, 9 (1986), 29-39.
21. Rousseeuw, P. I., and Ruts, I. Constructing the bivariate tukey median. Statistica Sinica 8 (1998), 827-839.
22. Rousseeuw, P. I., Ruts, I., and Tukey, I. W. The bagplot: A bivariate boxplot. The American Statistician 53, 4 (1999), 382-387.
23. Ruts, I., and Rousseeuw, P. Computing depth contours of bivariate point clouds. Computational Statistics and Data Analysis 23 (1996), 153-168