The spherical visibility map

CAD Computer Aided Design

Volumn 39, Issue 1, 2007, Pages 17-26

  Keeler, Todd ^a   Fedorkiw, John ^a   Ghali, Sherif ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

Spherical projection; Vector graphics; Vector visibility

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; DATA STRUCTURES; ROBUSTNESS (CONTROL SYSTEMS); VECTORS;

SPHERICAL MAP; SPHERICAL PROJECTION; VECTOR GRAPHICS; VECTOR VISIBILITY;

VISIBILITY;

EID: 33845948231     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cad.2006.08.007     Document Type: Article

References (62)

1. Appel A. The notion of quantitative invisibility and the machine rendering of solids. In: Proc. ACM national conf. 1967. p. 387-93
2. Also published in. In: Wolfe R. (Ed). Seminal graphics (1998), ACM Press 19-26
3. Austern M.H. Generic programming and the STL: Using and extending the C++ standard template library (1998), Addison-Wesley
4. Daniel A. GLOW. http://glow.sourceforge.net/
5. Bajaj C. The algebraic degree of geometric optimization problems. Discrete Comput Geom 3 (1988) 177-191
6. Bartuschka U, Mehlhorn K, Näher S. A robust and efficient implementation of a sweep line algorithm for the straight line segment intersection problem. In: Proc. workshop on algorithm engineering. 1997. p. 124-35
7. Baumgart BG. A polyhedron representation for computer vision. In: Proc. AFIPS natl. comput. conf., vol. 44. 1975. p. 589-96
8. Blinn J. Fractional invisibility. IEEE Comput Graph Appl 8 6 (1988) 77-84
9. Also available in Jim Blinn's Corner. A trip down the graphics pipeline (1996), Morgan Kaufman [chapter 10]
10. Boissonnat J-D, Preparata FP. Robust plane sweep for intersecting segments. Report TR 3270. Sophia Antipolis: INRIA; 1997
11. Carlbom I., and Paciorek J. Geometric projection and viewing transformations. ACM Comput Surv 10 (1978) 465-502
12. CGAL reference manual. CGAL 3.1 ed. http://www.cgal.org/
13. Chin N, Feiner S. Near real-time shadow generation using BSP trees. In: SIGGRAPH'89 1989. p. 99-106
14. Dadoun N, Kirkpatrick DG, Walsh JP. The geometry of beam tracing. In: Proc. of the symp. on computational geometry. 1985. p. 55-61. The use of BSP trees and hierarchical bounding volumes for fast beam intersection testing
15. de Berg M. Efficient algorithms for ray shooting and hidden surface removal. Ph.D. dissertation. Utrecht (Netherlands): Dept. Comput. Sci., Utrecht Univ; 1992
16. de Berg M., Halperin D., Overmars M.H., Snoeyink J., and van Kreveld M.J. Efficient ray shooting and hidden surface removal. Algorithmica 12 1 (1994) 30-53
17. Dévai F. Quadratic bounds for hidden line elimination. In: Proc. 2nd annu. ACM sympos. comput. geom. 1986. p. 269-75
18. Dévai F. An intersection-sensitive hidden-surface algorithm. In: Marechal G. (Ed). Eurographics'87 (1987), North-Holland 495-502
19. Dobrindt K, Mehlhorn K, Yvinec M. A complete and efficient algorithm for the intersection of a general and a convex polyhedron. In: Proc. 3rd workshop algorithms data struct. In: Lecture notes comput. sci., vol. 709. 1993. p. 314-24
20. Dorward S.E. A survey of object-space hidden surface removal. Internat J Comput Geom Appl 4 (1994) 325-362
21. Fabri A., Giezeman G.-J., Kettner L., Schirra S., and Schönherr S. On the design of CGAL: A computational geometry algorithms library. Softw-Pract Exp 30 11 (2000) 1167-1202
22. Flato E., Halperin D., Hanniel I., Nechushtan O., and Ezra E. The design and implementation of planar maps in CGAL. ACM J Exp Algorithms 5 (2000) 13
23. Foley J.D., van Dam A., Feiner S.K., and Hughes J.F. Computer graphics: Principles and practice in C. 2nd ed. (1995), Addison-Wesley
24. Fortune S. Topological beam tracing. In: Sympos on comput geom. 1999. p. 59-68
25. Franklin WR. A linear time exact hidden surface algorithm. In: SIGGRAPH'80, vol. 14(3). 1980. p. 117-23
26. Fuchs H, Kedem ZM, Naylor B. On visible surface generation by a priori tree structures. In: SIGGRAPH'80, vol. 14(3). 1980. p. 124-33
27. Galimberti R., and Montanari U. An algorithm for hidden-line elimination. Commun ACM 12 4 (1969) 206-211
28. Goodrich M.T. A polygonal approach to hidden-line and hidden-surface elimination. CVGIP: Graph Models Image Process 54 1 (1992) 1-12
29. Gordon D., and Chen S. Front-to-back display of BSP trees. IEEE Comput Graph Appl (1991) 79-85
30. Guibas L.J., and Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans Graph 4 2 (1985) 74-123
31. Heckbert PS, Hanrahan P. Beam tracing polygonal objects. In: SIGGRAPH'84, vol. 18(3). 1984. p. 119-27
32. Katz M.J., Overmars M.H., and Sharir M. Efficient hidden surface removal for objects with small union size. Comput Geom 2 (1992) 223-234
33. Kitsios N., and Tsakalidis A. Space reduction and an extension for a hidden line elimination algorithm. Comput Geom 6 (1996)
34. Loutrel P.P. A solution to the hidden-line problem for computer drawn polyhedra. IEEE Trans Comput C-19 (1970) 205-213
35. Mäntylä M. An introduction to solid modeling (1988), Computer Science Press, Rockville (MD)
36. Mäntylä M.J., and Sulonen R. GWB: A solid modeler with Euler operators. IEEE Comput Graph Appl 2 5 (1982) 17-31
37. McKenna M. Worst-case optimal hidden-surface removal. ACM Trans Graph 6 (1987) 19-28
38. Muller D.E., and Preparata F.P. Finding the intersection of two convex polyhedra. Theor Comput Sci 7 (1978) 217-236
39. Mulmuley K. An efficient algorithm for hidden surface removal. In: SIGGRAPH'89, vol. 23(3). 1989. p. 379-88
40. Naylor B. Binary space partitioning trees as an alternative representation of polytopes. Comput Aided Design 22 4 (1990) 250-252
41. Naylor B. Partitioning tree image representation and generation from 3d geometric models. In: Proceedings of graphics interface'92. 1992. p. 201-12
42. Naylor B, Amanatides JA, Thibault W. Merging BSP trees yields polyhedral set operations. In: SIGGRAPH'90, vol. 24(4). 1990. p. 115-24
43. Newell M, Newell R, Sancha T. A new solution to the hidden surface problem. In: Proc. ACM annual conf. 1972. p. 443-8
44. Paoluzzi A, Baldazzi C. Dimension-independent BSP (1): Section and interior to boundary mapping. Technical report. July 07. 1997
45. Ricci A. An algorithm for the removal of hidden lines in 3d scenes. Comput J 14 4 (1971) 375-377
46. Roberts L. Machine perception of 3-D solids. Technical report. Lincoln Lab (Cambridge): MIT; 1963
47. Schmitt A. On the time and space complexity of certain exact hidden line algorithms. Report 24/81, Fakultät Inform. Karlsruhe (West Germany): Univ. Karlsruhe; 1981
48. Schmitt A. Time and space bounds for hidden line and hidden surface algorithms. Proc. eurographics 81 (1981), North-Holland, Amsterdam (Netherlands) 43-56
49. Schumacher R, Brand R, Gilliland M, Sharp W. Study for applying computer-generated images to visual simulation. Technical report. Air Force Human Resources Laboratory, Training Research Division; 1969
50. Sechrest S., and Greenberg D.P. A visible polygon reconstruction algorithm. ACM Trans Graph 1 1 (1982) 25-42
51. Seel M. Planar nef polyhedra and generic higher-dimensional geometry. Ph.D. thesis. Universität des Saarlandes; August 2001
52. Sharir M., and Overmars M. A simple output-sensitive algorithm for hidden-surface removal. ACM Trans Graph 11 (1992) 1-11
53. Sutherland I.E., and Hodgman G.W. Reentrant polygon clipping. Commun ACM 17 (1974) 32-42
54. Sutherland I.E., Sproull R.F., and Schumacker R.A. A characterization of ten hidden-surface algorithms. ACM Comput Surv 6 1 (1974) 1-55
55. Teller SJ, Séquin CH. Visibility preprocessing for interactive walktroughs. In: SIGGRAPH'91, vol. 25(4). 1991. p. 61-9
56. Thibault WC. Application of binary space partitioning trees to geometric modeling and ray-tracing. Ph.D. thesis. Georgia Institute of Technology; 1987
57. Thibault WC, Naylor BF. Set operations on polyhedra using binary space partitioning trees. In: SIGGRAPH'87, vol. 21(4). 1987. p. 153-62
58. Tsingos N, Funkhouser T, Ngan A, Carlbom I. Modeling acoustics in virtual environments using the uniform theory of diffraction. In: SIGGRAPH'01. 2001. p. 545-52
59. Warnock J. A hidden-surface algorithm for computer generated half-tone pictures. Technical Report TR 4-15, NTIS AD-733 671. University of Utah, Computer Science Department; 1969
60. Weiler K, Atherton P. Hidden surface removal using polygon area sorting. In: SIGGRAPH'77, vol. 11(2). 1977. p. 214-22
61. Durand F. 3D visibility: Analytical study and applications. Université Joseph Fourier, Grenoble, France; 1999
62. Ghali S. A geometric framework for computer graphics addressing modeling, visibility, and shadows. University of Toronto, Toronto, Canada; 1999