Introduction to geometric computing

Introduction to Geometric Computing

Volumn , Issue , 2008, Pages 1-340

  Ghali, Sherif ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892338608     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-84800-115-2     Document Type: Book

References (121)

1. M.H. Austern. Generic Programming and the STL: Using and Extending the C++ Standard Template Library. Addison-Wesley, 1998. [265]
2. A. Baer, C. Eastman, and M. Henrion. Geometric modelling: A survey. Computer-Aided Design, 11(5):253-272, September 1979. [238]
3. C. Bajaj. The algebraic degree of geometric optimization problems. Discrete Comput. Geom., 3:177-191, 1988. [65]
4. C. Baldazzi and A. Paoluzzi. Dimension-independent BSP (1): Section and interior to boundary mapping. Technical Report RT-DIA-26-97, Roma Tre, July 1997. [267]
5. T.F. Banchoff. Beyond the Third Dimension. W. H. Freeman, 1996. [240]
6. J.J. Barton and L.R. Nackman. Scientific and Engineering C++: An Introduction with Advanced Techniques and Examples. Addison-Wesley, 1994. [186]
7. B.G. Baumgart. A polyhedron representation for computer vision. In Proc. AFIPS Natl. Comput. Conf., volume 44, pages 589-596, 1975. [247, 249]
8. E.T. Bell. Men of Mathematics. Simon & Schuster, 1937. [109, 175]
9. M. Berger. Géométrie, volume 2. Nathan, 2nd edition, 1977. [87]
10. M. Berger. Géométrie, volume 5. Nathan, 2nd edition, 1977. [98, 107]
11. H. Bieri and W. Nef. Elementary set operations with d-dimensional polyhedra. In Computational Geometry and Its Applications, volume 333 of LNCS, pages 97-112. Springer-Verlag, 1988. [276]
12. J.F. Blinn. Models of light reflection for computing synthesized pictures. Computer Graphics, pages 192-198, July 1977. [206]
13. J.F. Blinn. Me and my (fake) shadow. IEEE Comput. Graph. & Appl., 8(1):82- 86, 1988. [35]
14. J.F. Blinn. A trip down the graphics pipeline: Line clipping. IEEE Comput. Graph. & Appl., pages 98-105, January 1991. [57, 161]
15. J.F. Blinn. A trip down the graphics pipeline: The homogeneous perspective transform. IEEE Comput. Graph. & Appl., pages 75-80, May 1993. [114, 156]
16. J.F. Blinn. Vectors and geometry and objects, oh my! IEEE Comput. Graph. & Appl., 25(3):84-93, 2005. [39, 189]
17. J.F. Blinn and M.E. Newell. Clipping using homogeneous coordinates. Comput. Graph., pages 245-251, August 1978. [140, 156]
18. J.-D. Boissonnat and F.P. Preparata. Robust plane sweep for intersecting segments. Report TR 3270, INRIA, Sophia Antipolis, September 1997. [65]
19. C.B. Boyer. History of Analytic Geometry. Dover, 2004. [80, 119]
20. C.B. Boyer and U.C. Merzbach. A History of Mathematics. Wiley, 2nd edition, 1991. [127]
21. J.E. Bresenham. Algorithm for computer control of a digital plotter. IBM Systems Journal, 4(1):25-30, 1965. [77, 193, 196]
22. C. Buchheim, M. Jünger, and S. Leipert. Drawing rooted trees in linear time. Software - Practice and Experience, 36:651-665, 2006. [224]
23. CGAL Reference Manual, CGAL 3.3.1 edition, September 2007. http://www.-cgal.org/. [v, 19, 41, 189, 265]
24. H. Chiyokura. Solid Modelling with Designbase: Theory and Implementation. Addison-Wesley, 1988. [v]
25. H.S.M. Coxeter. Regular Polytopes. Dover, 1973. [240, 241]
26. H.S.M. Coxeter. Projective Geometry. Springer, 2nd edition, 1987. [136, 189]
27. H.S.M. Coxeter. Introduction to Geometry. Wiley, 2nd edition, 1989. [34, 38, 82, 118, 142, 146, 241, 243]
28. H.S.M. Coxeter. Non-Euclidean Geometry. MAA, 6th edition, 1998. [114, 129, 190]
29. M.J. Crowe. A History of Vector Analysis. Dover, 1994. [119]
30. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, 2nd edition, 2000. [276]
31. P. de Casteljau. Les quaternions. Hermes, 1987. [104]
32. G. di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999. [v, 224]
33. L. Dorst, D. Fontijne, and S. Mann. Geometric Algebra for Computer Science. Morgan Kaufmann, 2007. [ix, 18, 155]
34. C.M. Eastman and K. Weiler. Geometric modeling using the Euler operators. In Proceedings of 1st Ann. Conf. on Comput. Graph. in CAD/CAM Systems, pages 248-254, April 1979. [249]
35. H. Edelsbrunner, M.H. Overmars, and D. Wood. Graphics in Flatland: A case study. In F.P. Preparata, editor, Computational Geometry, volume 1 of Adv. Comput. Res., pages 35-59. JAI Press, 1983. [290]
36. A. Fabri, G.-J. Giezeman, L. Kettner, S. Schirra, and S. Schönherr. On the design of CGAL: A computational geometry algorithms library. Software - Practice and Experience, 30(11):1167-1202, September 2000. [183, 265]
37. S. Fortune and C.J. Van Wyk. Efficient exact arithmetic for computational geometry. In Proc. 9th Ann. ACM Symp. Comput. Geom., pages 163-172, May 1993. [80]
38. H. Fuchs, Z.M. Kedem, and B. Naylor. On visible surface generation by a priori tree structures. Comput. Graph., 14(3):124-133, July 1980. [255]
39. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995. [278]
40. R. Goldman. Illicit expressions in vector algebra. ACM Trans. on Graphics, 4(3):223-243, 1985. [10, 181]
41. R. Goldman. On the algebraic and geometric foundations of computer graphics. ACM Trans. on Graph., 21(1):52-86, January 2002. [155]
42. H. Gouraud. Continuous shading of curved surfaces. IEEE Trans. on Computers, C-20(6):623-629, June 1971. [207]
43. I. Grattan-Guinness, editor. Landmark Writings in Western Mathematics 1640- 1940. Elsevier, 2005. [143]
44. L. Guibas, M. Karavelas, and D. Russel. A computational framework for handling motion. In ALENEX, 2004. [ix]
45. P. Hachenberger, L. Kettner, and K. Mehlhorn. Boolean operations on 3d selective Nef complexes: Data structure, algorithms, optimized implementation and experiments. Computational Geometry: Theory and Applications, 38(1-2):64- 99, September 2007. [276]
46. A.J. Hanson. Visualizing Quaternions. Morgan Kaufmann, 2006. [46, 105, 107]
47. I. Herman. The Use of Projective Geometry in Computer Graphics. Springer- Verlag, 1992. [140]
48. S. Hert, M. Hoffmann, L. Kettner, S. Pion, and M. Seel. An adaptable and extensible geometry kernel. Computational Geometry: Theory and Applications, 38:16-36, 2007. [183]
49. D. Hilbert and S. Cohn-Vóssen. Geometry and the Imagination. Chelsea Publishing, 1952. [114]
50. F.S. Hill. Computer Graphics. Prentice-Hall, 2nd edition, 2001. [138]
51. C. Hoffmann. Geometric and Solid Modeling. Morgan Kaufmann, 1989. [v]
52. C. Hoffmann. Robustness in geometric computation. Journal of Comp. and Inf. Sci. in Eng., 1:143-155, June 2001. [80, 275]
53. A. Holden. Shapes, Space, and Symmetry. Columbia University Press, 1971. [253]
54. IEEE Standard for binary floating-point arithmetic ANSI/IEEE Std 754 - 1985.
55. Reprinted in SIGPLAN notices, 22(2):9-25, 1987. [11, 74]
56. M.J. Katz, M.H. Overmars, and M. Sharir. Efficient hidden surface removal for objects with small union size. Comput. Geom. Theory Appl., 2:223-234, 1992. [289]
57. T. Keeler, J. Fedorkiw, and S. Ghali. The spherical visibility map. Computer- Aided Design, 39(1):17-26, January 2007. [275, 293]
58. L. Kettner, K. Mehlhorn, S. Pion, S. Schirra, and C. Yap. Classroom examples of robustness problems in geometric computations. In Proc. 12th Ann. Euro. Symp. Algorithms (ESA'04), pages 702-713. Springer-Verlag, September 2004. LNCS 3221. [76, 82]
59. F. Klein. Le programme d'Erlangen. Gauthier-Villars, 1974. [166]
60. J.R. Kline. Double elliptic geometry in terms of point and order. Annals of Math., 18(1):31-44, 1916. [151]
61. D.E. Knuth. Optimum binary search trees. Acta Informatica, 1:14-25, 1971. [221]
62. D.E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, 2003. [227]
63. S. Laveau and O. Faugeras. Oriented projective geometry for computer vision. In European Conference on Computer Vision, 1996. [150]
64. D.T. Lee and B.J. Schachter. Two algorithms for constructing Delaunay triangulations. Intl. J. Comput. Inform. Sci., 9(3):219-242, 1980. [82, 276]
65. S. Mann, N. Litke, and T. DeRose. A coordinate free geometry ADT. Technical Report CS-97-15, University of Waterloo, July 1997. [62, 181]
66. M. Mäntylä. An Introduction to Solid Modeling. Computer Science Press, 1988. [v, 246]
67. M. Mäntylä and R. Sulonen. GWB: A solid modeler with Euler operators. IEEE Comput. Graph. & Appl., 2(5):17-31, 1982. [249]
68. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 1999. [v, 24, 72, 93, 183, 227]
69. K. Mehlhorn and M. Seel. Infimaximal frames: A technique for making lines look like segments. Intl. J. Comput. Geometry Appl., 13(3), 2003. [271]
70. J.R. Miller. Vector geometry for computer graphics. IEEE Comput. Graph. & Appl., 19(3):66-73, 1999. [181]
71. A.F. Möbius. Der barycentrische Calcul. Johann Ambrosius Barth, 1827. [143]
72. N.C. Myers. Traits: A new and useful template technique. C++ Report, June 1995. [184, 228, 266]
73. B. Naylor, J.A. Amanatides, andW. Thibault. Merging BSP trees yields polyhedral set operations. Comput. Graph., 24(4):115-124, August 1990. [268]
74. W.M. Newman and R.F. Sproull. Principles of Interactive Computer Graphics. McGraw-Hill, 2nd edition, 1979. [57]
75. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1998. [82, 276]
76. M.H. Overmars. Designing the computational geometry algorithms library CGAL. In Proc. 1st ACM Workshop on Appl. Comput. Geom., pages 113-119, May 1996. [183]
77. A. Paoluzzi. Geometric Programming for Computer Aided Design. Wiley, 2003. [267]
78. R. Parent. Computer Animation: Algorithms and Techniques. Morgan Kaufmann, 2001. [ix]
79. 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. [288]
80. M.A. Penna and R.R. Patterson. Projective Geometry and Its Applications to Computer Graphics. Prentice-Hall, 1986. [110, 112, 136]
81. B.-T. Phong. Illumination for computer generated pictures. Commun. of the ACM, 18(6):311-317, June 1975. [205, 207]
82. J. Plücker. Fundamental views regarding mechanics. Proc. of the Royal Soc. of London, 15:204-208, 1866-1867. [8]
83. H. Preece, Y. Rogers, and J. Sharp. Interaction Design. Wiley, 2002. [253]
84. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. [81, 210, 276]
85. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Software Eng., SE-7(2):223-228, 1981. [223]
86. A.A.G. Requicha. Representations of rigid solids: theory, methods, and systems. ACM Computing Surveys, 12:437-464, 1980. [vi]
87. A.A.G. Requicha. Geometric modeling: A first course, 1999. Web notes. [249, 281]
88. R.F. Riesenfeld. Homogeneous coordinates and projective planes in computer graphics. IEEE Comput. Graph. & Appl., pages 50-55, January 1981. [114, 123]
89. J.R Rossignac and M.A. O'Connor. SGC: A dimension-independent model for pointsets with internal structures and incomplete boundaries. In M.J. Wozny, J.U. Turner, and K. Preiss, editors, Geometric Modeling for Product Engineering, pages 145-180. Elsevier, 1990. [248]
90. G.-C. Rota. Indiscrete Thoughts. Birkhäuser, 1997. [156]
91. S. Schirra. Robustness and precision issues in geometric computation. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 14. Elsevier, 1999. [80]
92. S. Schirra. Real numbers and robustness in computational geometry. Real Numbers and Computers, pages 7-21, November 2004. Dagstuhl. [80]
93. J. Schwerdt and M. Smid. Computational geometry on the unit sphere. Technical report, Carleton University, 2002. LEDA Extension Package. [93]
94. R. Sedgewick. Algorithms in C++ Part 5: Graph Algorithms. Addison-Wesley, 2002. [227]
95. J.G. Semple and G.T. Kneebone. Algebraic Projective Geometry. Oxford University Press, 1952. [129, 133]
96. M. Serfati. René Descartes, Geometria. In I. Grattan-Guinness, editor, Landmark Writings in Western Mathematics 1640-1940, pages 1-22. Elsevier, 2005. [80]
97. P. Shirley. Fundamentals of Computer Graphics. AK Peters, 2nd edition, 2005. [146]
98. K. Shoemake. Animating rotations with quaternion curves. Comput. Graph., 19(3):245-254, July 1985. [107]
99. K. Shoemake. ARCBALL: A user interface for specifying three-dimensional orientation using a mouse. In Graphics Interface, pages 151-156, May 1992. [326]
100. D. Shreiner, M. Woo, J. Neider, and T. Davis. OpenGL Programming Guide. Addison-Wesley, 4th edition, 2004. [311]
101. J.G. Siek, L.-Q. Lee, and A. Lumsdaine. The Boost Graph Library User Guide and Reference Manual. Addison-Wesley, 2001. [227, 265]
102. A.R. Smith. A pixel is not a little square. Technical report, Microsoft, July 1995. Technical Memo 6. [193]
103. R.F. Sproull. Using program transformations to derive line-drawing algorithms. ACM Trans. on Graphics, 1(4):259-273, 1982. [77, 193, 196]
104. J. Stillwell. The Four Pillars of Geometry. Springer-Verlag, 2005. [107]
105. J. Stolfi. Oriented Projective Geometry: A Framework for Geometric Computations. Academic Press, 1991. [99, 141, 149, 151, 166, 215]
106. B. Stroustrup. The C++ Programming Language. Addison-Wesley, special 3rd edition, 2000. [4]
107. D.J. Struik. A Concise History of Mathematics. Dover, 4th revised edition, 1987. [118]
108. I.E. Sutherland and G.W. Hodgman. Reentrant polygon clipping. Commun. of the ACM, 17:32-42, 1974. [17, 59, 140, 156, 261]
109. I.E. Sutherland, R.F. Sproull, and R.A. Schumacker. A characterization of ten hidden-surface algorithms. ACM Computing Surveys, 6(1):1-55, March 1974. [293]
110. W.C. Thibault and B.F. Naylor. Set operations on polyhedra using binary space partitioning trees. Comput. Graph., 21(4):153-162, 1987. [256, 268]
111. F. Toth. Regular Figures. Macmillan, 1964. [244]
112. W.T. Tutte. How to draw a graph. Proc. London Math. Soc., 3(13):743-767, 1963. [231]
113. D. Vandevoorde and N.M. Josuttis. C++ Templates. Addison-Wesley, 2002. [184, 228, 266]
114. G.S. Watkins. A Real Time Visible Surface Algorithm. PhD thesis, University of Utah, June 1970. UTECH-CSc-70-101. [210]
115. K. Weiler. Edge-based data structures for solid modeling in a curved surface environment. IEEE Comput. Graph. & Appl., 5(1):21-40, 1985. [238]
116. K. Weiler. The radial edge structure: A topological representation for nonmanifold geometric boundary modeling. In Geometric Modeling for CAD Applications, pages 3-36. IFIP, May 1988. [248]
117. M. Wenninger. Spherical Models. Cambridge University Press, 1979. [99]
118. C.Wetherell and A. Shannon. Tidy drawing of trees. IEEE Trans. Software Eng., SE-5(5):514-520, 1979. [223]
119. T. Whitted. An improved illumination model for shaded display. Commun. of the ACM, 23(6):343-349, June 1980. [213]
120. J. Woodwark. How to Run a Paper Mill. Information Geometers, 1992. [ix]
121. C.K. Yap. Towards exact geometric computation. Comput. Geom. Theory Appl., 7:3-23, 1997. [80]