Geometric Data Structures for Computer Graphics
Regular price
€167.40
14 days return policy
Shipping & Delivery
A01=Elmar Langetepe
A01=Gabriel Zachmann
Author_Elmar Langetepe
Author_Gabriel Zachmann
Binary Decomposition
Binary Space Partitioning Trees
BSP
BSP Tree
BVs
Category=UB
Category=UG
Category=UMB
Category=UY
computational geometry
computer graphics algorithms
Directed Hausdorff Distance
Edge Flip
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
generic dynamization techniques
Geometric Data Structures
geometric proximity graphs
Ghost Nodes
Insert Operations
Morph Targets
Oriented Bounding Boxes
Point Cloud
Proximity Graph
Query Operation
Range Query
RNG
Search Tree
Segment Tree
Splitting Plane
Static Data Structure
tree-based geometric data structure
Voronoi Cell
Voronoi Diagram
Voronoi Region
Windowing Queries
Product details
- ISBN 9781568812359
- Weight: 589g
- Dimensions: 152 x 229mm
- Publication Date: 16 Jan 2006
- Publisher: Taylor & Francis Inc
- Publication City/Country: US
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Data structures and tools from computational geometry help to solve problems in computer graphics; these methods have been widely adopted by the computer graphics community yielding elegant and efficient algorithms. This book focuses on algorithms and data structures that have proven to be versatile, efficient, fundamental, and easy to implement. The book familiarizes students, as well as practitioners in the field of computer graphics, with a wide range of data structures. The authors describe each data structure in detail, highlight fundamental properties, and present algorithms based on the data structure. A number of recent representative and useful algorithms from computer graphics are described in detail, illuminating the utilization of the data structure in a creative way.
Langetepe, Elmar; Zachmann, Gabriel
