Geometric Tools for Computer Graphics

作者: Philip J. Schneider , David Eberly

DOI:

关键词:

摘要: From the Publisher: Do you spend too much time creating building blocks of your graphics applications or finding and correcting errors? Geometric Tools for Computer Graphics is an extensive, conveniently organized collection proven solutions to fundamental problems that you'd rather not solve over again, including primitives, distance calculation, approximation, containment, decomposition, intersection determination, separation, more. If have a mathematics degree, this book will save trouble. If don't, it help achieve things may feel are out reach. Inside, each problem clearly stated diagrammed, fully detailed presented in easy-to-understand pseudocode. You also get geometry background needed make optimal use solutions, as well abundance reference material contained series appendices. KEY FEATURES: * Filled with robust, thoroughly tested avoid costly errors. * Covers relevant both 2D 3D programming. * Presents solution stand-alone form allowing option reading only those entries matter you. * Provides math need understand put them work. * Clearly diagrams presents pseudocode. * Resources associated available at companion Web site. Author Biography: Philip Schneider leads modeling dynamic simulation software group Walt Disney Feature Animation. Prior that, his work Apple Digital Equipment Corporation ranged from low-level interfaces libraries interactive applications. He holds M.S. Science University Washington. Dave Eberly president Magic Software, Inc., company known its free source code documentation computer graphics, image analysis, numerical methods. Previously, he was director engineering Numerical Design Limited, responsible real-time game engine, NetImmerse. His includes B.A. Bloomsburg University, Ph.D. degrees Colorado Boulder, science North Carolina Chapel Hill. Dave author Game Engine Design, co-author Graphics, forthcoming Physics (Spring 2003).

参考文章(131)
S. Cameron, R. Culley, Determining the minimum translational distance between two convex polyhedra international conference on robotics and automation. ,vol. 3, pp. 591- 596 ,(1986) , 10.1109/ROBOT.1986.1087645
J.R. Miller, Vector geometry for computer graphics IEEE Computer Graphics and Applications. ,vol. 19, pp. 66- 73 ,(1999) , 10.1109/38.761552
Daniel L. Toth, On ray tracing parametric surfaces international conference on computer graphics and interactive techniques. ,vol. 19, pp. 171- 179 ,(1985) , 10.1145/325165.325233
Jaroslaw R. Rossignac, Aristides A. G. Requicha, Piecewise-circular curves for geometric modeling Ibm Journal of Research and Development. ,vol. 31, pp. 296- 313 ,(1987) , 10.1147/RD.313.0296
S. Cameron, Enhancing GJK: computing minimum and penetration distances between convex polyhedra international conference on robotics and automation. ,vol. 4, pp. 3112- 3117 ,(1997) , 10.1109/ROBOT.1997.606761
M.C. Lin, J.F. Canny, A fast algorithm for incremental distance calculation international conference on robotics and automation. pp. 1008- 1014 ,(1991) , 10.1109/ROBOT.1991.131723
Gino Van den Bergen, A fast and robust GJK implementation for collision detection of convex objects Journal of Graphics Tools. ,vol. 4, pp. 7- 25 ,(1999) , 10.1080/10867651.1999.10487502
E.G. Gilbert, D.W. Johnson, S.S. Keerthi, A fast procedure for computing the distance between complex objects in three-dimensional space international conference on robotics and automation. ,vol. 4, pp. 193- 203 ,(1988) , 10.1109/56.2083
David F. Rogers, J. Alan Adams, Mathematical elements for computer graphics ,(1976)