Geometric Data Structures for Computer Graphics

Elmar Langetepe, Gabriel Zachmann

340 pages, parution le 15/10/2005

Ajouter à une liste

Indisponible

Résumé

Geometric Data Structures for Computer Graphics presents many ways in which data structures and algorithms from computational geometry help to solve problems in computer graphics in an elegant and efficient manner. Readers of this book will be able to recognize geometric problems and select the most suitable data structure when developing computer graphics algorithms.

Definitions, properties, algorithms, and examples of use for

Quadtrees
Orthogonal Windowing and Stabbing Queries
BSP Trees
Bounding Volume Hierarchies
Distance Fields
Voronoi Diagrams
Geometric Proximity Graphs

Learn how to make existing data structures

kinetic
robust
dynamic

Sommaire

Preface
Quadtrees and Octrees
Orthogonal Windowing and Stabbing Queries
BSP Trees
Bounding Volume Hierarchies
Distance Fields
Voronoi Diagrams
Geometric Proximity Graphs
Kinetic Data Structures
Degeneracy and Robustness
Dynamization of Geometric Data Structures
Bibliography
Index

Voir tout

Replier

Caractéristiques techniques

	PAPIER
Éditeur(s)	AK Peters
Auteur(s)	Elmar Langetepe, Gabriel Zachmann
Parution	15/10/2005
Nb. de pages	340
Format	16 x 23,5
Couverture	Relié
Poids	588g
Intérieur	Noir et Blanc
EAN13	9781568812359
ISBN13	978-1-56881-235-9