東華大學圖書館 |

Collison detection in interactive 3D environments

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Collison detection in interactive 3D environments/ Gino van den Bergen.
作者:	Bergen, Gino Johannes Apolonia van den,
出版者:	Amsterdam ;Elsevier/Morgan Kaufman, : c2004.,
面頁冊數:	1 online resource (xx, 278 p.) :ill.
內容註:	Introduction: Describes the problem domain, historical background, and book organization. Concepts: Defines the mathematical and algorithmic concepts that are relevant in the context of collision detection. Basic primitives: Describes intersection tests for combinations of primitives, such as spheres, boxes, line segments, triangles, and general polygons. Convex Objects: Discusses methods for performing proximity queries on convex objects. The main part of this chapter is dedicated to the Gilbert-Johnson-Keerthi (GJK) algorithm. Spatial Data Structures: Discusses a number of spatial data structures that are used for quick rejection of non-intersecting pairs of primitives. Design of SOLID: An in-depth discussion of the architecture of the SOLID collision detection library. Conclusion: New trends and interesting areas for future exploration.
標題:	Computer animation. -
電子資源:	http://www.sciencedirect.com/science/book/9781558608016
ISBN:	9781558608016

Collison detection in interactive 3D environments
Bergen, Gino Johannes Apolonia van den,1969-{me_controlnum}

Collison detection in interactive 3D environments[electronic resource] /Gino van den Bergen. - Amsterdam ;Elsevier/Morgan Kaufman,c2004. - 1 online resource (xx, 278 p.) :ill. - The Morgan Kaufmann series in interactive 3D technology. - Morgan Kaufmann series in interactive 3D technology..

Includes bibliographical references and index.

Introduction: Describes the problem domain, historical background, and book organization. Concepts: Defines the mathematical and algorithmic concepts that are relevant in the context of collision detection. Basic primitives: Describes intersection tests for combinations of primitives, such as spheres, boxes, line segments, triangles, and general polygons. Convex Objects: Discusses methods for performing proximity queries on convex objects. The main part of this chapter is dedicated to the Gilbert-Johnson-Keerthi (GJK) algorithm. Spatial Data Structures: Discusses a number of spatial data structures that are used for quick rejection of non-intersecting pairs of primitives. Design of SOLID: An in-depth discussion of the architecture of the SOLID collision detection library. Conclusion: New trends and interesting areas for future exploration.

The heart of any system that simulates the physical interaction between objects is collision detection-the ability to detect when two objects have come into contact. This system is also one of the most difficult aspects of a physical simulation to implement correctly, and invariably it is the main consumer of CPU cycles. Practitioners, new to the field or otherwise, quickly discover that the attempt to build a fast, accurate, and robust collision detection system takes them down a long path fraught with perils and pitfalls unlike most they have ever encountered. Without in-depth knowledge and understanding of the issues associated with engineering a collision detection system, the end of that path is an abyss that has swallowed many a good programmer! Gino van den Bergen's new book is the story of his successful journey down that path. The outcome is his well-known collision detection system, the SOftware Library for Interference Detection (SOLID). Along the way, he covers the topics of vector algebra and geometry, the various geometric primitives of interest in a collision system, the powerful method of separating axes for the purposes of intersection testing, and the equally powerful Gilbert-Johnson-Keerthi (GJK) algorithm for computing the distance between convex objects. But this book provides much more than a good compendium of the ideas that go into building a collision system. The curse of practical computational geometry is floating-point arithmetic. Algorithms with straightforward implementations when using exact arithmetic can have catastrophic failures in a floating-point system. Specifically, intersection and distance algorithms implemented in a floating-point system tend to fail exactly in the most important case in a collision system-when two objects are just touching. Great care must be taken to properly handle floating-point round off errors. Gino's ultimate accomplishment in this book is his presentation on how to correctly implement the GJK distance algorithm in the presence of single-precision floating-point arithmetic. And what better way to illustrate this than with a case study, the final chapter on the design and implementation of SOLID. About the CD-ROM The companion CD-ROM includes the full C++ source code of SOLID 3.5 as well as API documentation in HTML and PDF formats. Both single (32bit) and double (64bit) precision versions of the SOLID SDK plus example programs can be compiled for Linux platforms using GNU g++ version 2.95 to 3.3 and for Win32 platforms using Microsoft Visual C++ version 6.0 to 7.1. Use of the SOLID source code is governed by the terms of either the GNU GPL or the Trolltech QPL (see CD-ROM documentation for details). About the Author Gino van den Bergen is a game developer living and working in The Netherlands. He is the creator of SOLID and holds a Ph. D. in computing science from Eindhoven University of Technology. Gino implemented collision detection and physics in NaN Technologies' Blender, a creation suite for interactive 3D content. *Explains the fundamental geometric and numerical concepts that underlie the key algorithms of collision detection. *CD-ROM includes the full C++ source code of SOLID, a well-known library for collision detection, plus binaries and example programs for Win32. *Discusses algorithms for commonly used primitive types, such as spheres, boxes, cylinders, cones, triangles, rays, and convex polyhedra. *Presents techniques for accelerating collision detection for complex models and scenes.

ISBN: 9781558608016

Source: 97123:97123Elsevier Science & Technologyhttp://www.sciencedirect.comSubjects--Topical Terms:

553066
Computer animation.
Index Terms--Genre/Form:

542853
Electronic books.

LC Class. No.: TR897.7 / .B482 2004

Dewey Class. No.: 006.6/96

Collison detection in interactive 3D environments
LDR:05721cmm 2200337Ia 4500 001 1046372
003 OCoLC
005 20111122085807.0
006 m d
007 cr cn|||||||||
008 120427s2004 ne a ob 001 0 eng d
020 $a 9781558608016
020 $a 155860801X
035 $a (OCoLC)499054359
035 $a ocn499054359
037 $a 97123:97123 $b Elsevier Science & Technology $n http://www.sciencedirect.com
040 $a OPELS $b eng $c OPELS $d OCLCQ
049 $a TEFA
050 4 $a TR897.7 $b .B482 2004
072 7 $a TK $2 lcco
082 0 4 $a 006.6/96 $2 22
100 1 $a Bergen, Gino Johannes Apolonia van den, $d 1969-{me_controlnum} $3 1375143
245 1 0 $a Collison detection in interactive 3D environments $h [electronic resource] / $c Gino van den Bergen.
260 $a Amsterdam ; $a Boston : $b Elsevier/Morgan Kaufman, $c c2004.
300 $a 1 online resource (xx, 278 p.) : $b ill.
490 1 $a The Morgan Kaufmann series in interactive 3D technology
504 $a Includes bibliographical references and index.
505 0 $a Introduction: Describes the problem domain, historical background, and book organization. Concepts: Defines the mathematical and algorithmic concepts that are relevant in the context of collision detection. Basic primitives: Describes intersection tests for combinations of primitives, such as spheres, boxes, line segments, triangles, and general polygons. Convex Objects: Discusses methods for performing proximity queries on convex objects. The main part of this chapter is dedicated to the Gilbert-Johnson-Keerthi (GJK) algorithm. Spatial Data Structures: Discusses a number of spatial data structures that are used for quick rejection of non-intersecting pairs of primitives. Design of SOLID: An in-depth discussion of the architecture of the SOLID collision detection library. Conclusion: New trends and interesting areas for future exploration.
520 $a The heart of any system that simulates the physical interaction between objects is collision detection-the ability to detect when two objects have come into contact. This system is also one of the most difficult aspects of a physical simulation to implement correctly, and invariably it is the main consumer of CPU cycles. Practitioners, new to the field or otherwise, quickly discover that the attempt to build a fast, accurate, and robust collision detection system takes them down a long path fraught with perils and pitfalls unlike most they have ever encountered. Without in-depth knowledge and understanding of the issues associated with engineering a collision detection system, the end of that path is an abyss that has swallowed many a good programmer! Gino van den Bergen's new book is the story of his successful journey down that path. The outcome is his well-known collision detection system, the SOftware Library for Interference Detection (SOLID). Along the way, he covers the topics of vector algebra and geometry, the various geometric primitives of interest in a collision system, the powerful method of separating axes for the purposes of intersection testing, and the equally powerful Gilbert-Johnson-Keerthi (GJK) algorithm for computing the distance between convex objects. But this book provides much more than a good compendium of the ideas that go into building a collision system. The curse of practical computational geometry is floating-point arithmetic. Algorithms with straightforward implementations when using exact arithmetic can have catastrophic failures in a floating-point system. Specifically, intersection and distance algorithms implemented in a floating-point system tend to fail exactly in the most important case in a collision system-when two objects are just touching. Great care must be taken to properly handle floating-point round off errors. Gino's ultimate accomplishment in this book is his presentation on how to correctly implement the GJK distance algorithm in the presence of single-precision floating-point arithmetic. And what better way to illustrate this than with a case study, the final chapter on the design and implementation of SOLID. About the CD-ROM The companion CD-ROM includes the full C++ source code of SOLID 3.5 as well as API documentation in HTML and PDF formats. Both single (32bit) and double (64bit) precision versions of the SOLID SDK plus example programs can be compiled for Linux platforms using GNU g++ version 2.95 to 3.3 and for Win32 platforms using Microsoft Visual C++ version 6.0 to 7.1. Use of the SOLID source code is governed by the terms of either the GNU GPL or the Trolltech QPL (see CD-ROM documentation for details). About the Author Gino van den Bergen is a game developer living and working in The Netherlands. He is the creator of SOLID and holds a Ph. D. in computing science from Eindhoven University of Technology. Gino implemented collision detection and physics in NaN Technologies' Blender, a creation suite for interactive 3D content. *Explains the fundamental geometric and numerical concepts that underlie the key algorithms of collision detection. *CD-ROM includes the full C++ source code of SOLID, a well-known library for collision detection, plus binaries and example programs for Win32. *Discusses algorithms for commonly used primitive types, such as spheres, boxes, cylinders, cones, triangles, rays, and convex polyhedra. *Presents techniques for accelerating collision detection for complex models and scenes.
588 $a Description based on print version record.
650 0 $a Computer animation. $3 553066
650 0 $a Three-dimensional display systems. $3 570207
655 4 $a Electronic books. $2 lcsh $3 542853
776 0 8 $i Print version: $a Bergen, Gino Johannes Apolonia van den, 1969- $t Collison detection in interactive 3D environments. $d Amsterdam ; Boston : Elsevier/Morgan Kaufman, c2004 $z 155860801X $z 9781558608016 $w (DLC) 2003059350 $w (OCoLC)52765878
830 0 $a Morgan Kaufmann series in interactive 3D technology. $3 940936
856 4 0 $3 ScienceDirect $u http://www.sciencedirect.com/science/book/9781558608016
994 $a C0 $b TEF