Collison detection in interactive 3D environments [electronic resource]

• 作者： Bergen, Gino Johannes Apolonia van den, 1969-
• 其他題名：
  • Morgan Kaufmann series in interactive 3D technology
• 出版： Amsterdam ;Boston : Elsevier/Morgan Kaufman
• 叢書名： The Morgan Kaufmann series in interactive 3D technology
• 主題： Computer animation , Three-dimensional display systems , Electronic books.
• ISBN： 9781558608016 、 155860801X
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: 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.
• More
• 摘要註: 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 dist
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: