An improved ray shooting method for constructive solid geometry models via tree contraction

International Journal of Computational Geometry and Applications

Volumn 8, Issue 1, 1998, Pages 1-23

  Goodrich, Michael T ^a  

^a Johns Hopkins University   (United States)

Author keywords

Boolean algebra; Constructive solid geometry; CSG tree; Geometric data structures; Ray casting; Ray shooting; Solid modeling; Tree contraction

Indexed keywords

EID: 0032350233     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195998000023     Document Type: Article

References (56)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, "A simple parallel tree contraction algorithm," J. Algorithms, 10, 287-302, 1989.
2. P. K. Agarwal and M. Sharir, "Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions," SIAM J. Comput., 25, 100-116, 1996.
3. Pankaj K. Agarwal, "Ray shooting and other applications of spanning trees with low stabbing number," SIAM J. Comput., 21, 540-570, 1992.
4. Pankaj K. Agarwal and J. Matoušek, "Ray shooting and parametric search," SIAM J. Comput., 22(4), 794-806, 1993.
5. M. Ben-Or, "Lower bounds for algebraic computation trees," in Proc. 15th Annu. ACM Sympos. Theory Comput., 80-86, 1983.
6. R. P. Brent, "The parallel evaluation of general arithmetic expressions," J. ACM, 21(2), 201-206, 1974.
7. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, "Ray shooting in polygons using geodesic triangulations," Algorithmica, 12, 54-68, 1994.
8. S. W. Cheng and R. Janardan, "Algorithms for ray-shooting and intersection searching," J. Algorithms, 13, 670-692, 1992.
9. R. F. Cohen and R. Tamassia, "Dynamic expression trees," Algorithmica, 13, 245-265, 1995.
10. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms,' The MIT Press, Cambridge, Mass., 1990.
11. M. de Berg, D. Halperin, M. Overmars, J. Snoeyink, and M. van Kreveld, "Efficient ray shooting and hidden surface removal," Algorithmica, 12, 30-53, 1994.
12. D. Dobkin, L. Guibas, J. Hershberger, and J. Snoeyink, "An efficient algorithm for finding the CSG representation of a simple polygon," Proc. SIGGRAPH '88, Computer Graphics, 22(4), 31-40, 1988.
13. D. P. Dobkin, "Computational geometry and computer graphics," Proc. IEEE, 80(9), 1400-1411, September 1992.
14. D. P. Dobkin and D. G. Kirkpatrick, "Fast detection of polyhedral intersection," Theoret. Comput. Sci., 27, 241-253, 1983.
15. D. P. Dobkin and D. G. Kirkpatrick, "A linear algorithm for determining the separation of convex polyhedra," J. Algorithms, 6, 381-392, 1985.
16. D. P. Dobkin and D. G. Kirkpatrick, "Determining the separation of preprocessed polyhedra - a unified approach," in Proc. 17th Internat. Colloq. Automata Lang. Program., Lecture Notes in Computer Science, vol. 443, Springer-Verlag, 400-413, 1990.
17. P. C. Dykstra and M. J. Muuss, "The BRL-CAD package: An overview," in Proc. BRL-CAD Symposium '89, Aberdeen Proving Ground, Maryland, 1-9, 1989.
18. P. C. Dykstra and M. J. Muuss, "The BRL-CAD package: An overview," in Proc. BRL-CAD Symposium '89, Aberdeen Proving Ground, Maryland, 1-9, 1989.
19. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, vol. 10, Springer-Verlag, Heidelberg, West Germany, 1987.
20. H. Edelsbrunner and E. P. Mücke, "Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms," ACM Trans. Graph., 9, 66-104, 1990.
21. J. L. Ellis, G. Kedem, T. C. Lyerly, D. G. Thielman, R. J. Marisa, J. P. Menon, and H. B. Voelcker, "The ray casting engine and ray representations: a technical summary," Internat. J. Comput. Geom. Appl., 1(4), 347-380, 1991.
22. D. Eppstein, "Asymptotic speed-ups in constructive solid geometry," Algorithmica, 13, 462-471, 1995.
23. M. A. Facello, "Improved ray tracing methods for CSG modeling systems," Report JHU-90/05, Dept. Comput. Sci., Johns Hopkins Univ., Baltimore, MD, 1990.
24. J. D. Foley, A. van Dam, S. K. Feiner, J. F. Hughes, and Phillips, Introduction to Computer Graphics, Addison-Wesley, Reading, MA, 1993.
25. 2) problems in computational geometry," Comput. Geom. Theory Appl., 5, 165-185, 1995.
26. P. Getto, "Fast ray tracing of unevaluated constructive solid geometry models," in New Advances in Computer Graphics: Proc. of Computer Graphics International '89, R. A. Earnshaw and B. Wyvel, editors, Springer-Verlag, 563-578, 1989.
27. J. Goldfeather, S. Molnar, G. Turk, and H. Fuchs, "Near real-time CSG rendering using tree normalization and geometric pruning," IEEE Computer Graphics and Applications, 9(3), 20-28, 1989.
28. M. T. Goodrich, M. Ghouse, and J. Bright, "Sweep methods for parallel computational geometry," Algorithmica, 15(2), 331-361, 1996.
29. M. T. Goodrich and R. Tamassia, "Dynamic ray shooting and shortest paths via balanced geodesic triangulations," in Proc. 9th Annu. ACM Sympos. Comput. Geom., 318-327, 1993.
30. L. Guibas, M. Overmars, and M. Sharir, "Intersecting line segments, ray shooting, and other applications of geometric partitioning techniques," in Proc. 1st Scand. Workshop Algorithm Theory, Lecture Notes in Computer Science, vol. 318, Springer-Verlag, 64-73, 1988.
31. L. Guibas, M. Overmars, and M. Sharir, "Ray shooting, implicit point location, and related queries in arrangements of segments," Report 433, Dept. Comput. Sci., New York Univ., New York, NY, March 1989.
32. F. W. Jansen, "Depth-order point classification techniques for CSG display algorithms," ACM Trans. on Graphics, 10(1), 40-70, 1991.
33. R. M. Karp and V. Ramachandran, "Parallel algorithms for shared memory machines," in Handbook of Theoretical Computer Science, J. van Leeuwen, editor, Elsevier/The MIT Press, Amsterdam, 869-941, 1990.
34. S. R. Kosaraju and A. L. Delcher, "Optimal parallel evaluation of tree-structured computations by raking," in Proc. AWOC 88, Lecture Notes in Computer Science, vol. 319, Springer-Verlag, 101-110, 1988.
35. D. H. Laidlaw, W. B. Trumbore, and J. F. Hughes, "Constructive solid geometry for polyhedral objects," Comput. Graph., 20(4), 161-170, 1986.
36. M. Mäntyl̈, An Introduction to Solid Modeling, Computer Science Press, Rockville, MD, 1988.
37. J. Matoušek and O. Schwarzkopf, "On ray shooting in convex polytopes," Discrete Comput. Geom., 10(2), 215-232, 1993.
38. G. L. Miller and S.-H. Teng, "Dynamic parallel complexity of computational circuits," in 19th ACM Symposium on Theory of Computing (STOC), 254-263, 1987.
39. G. L. Miller and J. H. Reif, "Parallel tree contraction and its application," in Proc. 26th IEEE Symp. on Foundations of Computer Science, 478-489, 1985.
40. T. Ottmann, P. Widmayer, and D. Wood, "A fast algorithm for Boolean mask operations," Comput. Vision Graph. Image Process., 30, 249-268, 1985.
41. M. S. Paterson and F. F. Yao, "Efficient binary space partitions for hidden-surface removal and solid modeling," Discrete Comput. Geom., 5, 485-503, 1990.
42. M. Pellegrini, "Stabbing and ray shooting in 3-dimensional space," in Proc. 6th Annu. ACM Sympos. Comput. Geom., 177-186, 1990.
43. F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, NY, 1985.
44. M. Reid-Miller, G. L. Miller, and F. Modugno, "List ranking and parallel tree contraction," in Synthesis of Parallel Algorithms, J. H. Reif, editor, Morgan Kaufmann Publishers, Inc., San Mateo, CA, 115-194, 1993.
45. A. A. G. Requicha, "Representations of rigid solids: theory, methods, and systems," ACM Comput. Surv., 12, 437-464, 1980.
46. A. A. G. Requicha and H. B. Voelcker, "Boolean operations in solid modelling: boundary evaluation and merging algorithms," Proc. IEEE, 73(1), 1985.
47. J. R. Rossignac and H. B. Voelcker, "Active zones in constructive solid geometry for redundancy and interference detection," Report RC 11991 (#53914), Auto. Res. Sci., IBM T. J. Watson Res. Center, Yorktown Heights, NY, 1986.
48. S. D. Roth, "Ray casting for modeling solids," Comput. Graph. Image Process., 18, 109-144, 1982.
49. H. Samet, Applications of Spatial Data Structures, Addison Wesley, Reading, MA, 1990.
50. H. Samet, The Design and Analysis of Spatial Data Structures, Addison-Wesley, Reading, MA, 1990.
51. J. M. Steele and A. C. Yao, "Lower bounds for algebraic decision trees," J. Algorithms, 3, 1-8, 1982.
52. M. S. Tawfik, "An efficient algorithm for CSG to B-Rep conversion," in ACM SIGGRAPH Symp. on Solid Modeling Foundations and CAD/CAM Applications, Austin, TX., 1991.
53. R. B. Tilove, "Set membership classification: a unified approach to geometric intersection problems," IEEE Trans. Comput., C-29, 874-883, 1980.
54. R. B. Tilove, "A null-object detection algorithm for constructive solid geometry," Commun. ACM, 27, 684-694, 1984.
55. F. F. Yao, "Computational geometry," in Algorithms in Complexity, R. A. Earnshaw and B. Wyvill, editors, Elsevier, Amsterdam, 345-490, 1990.
56. C. K. Yap, "A geometric consistency theorem for a symbolic perturbation scheme," J. Comput. Syst. Sci., 40, 2-18, 1990.