The goal of image synthesis is to create, using the computer, a visual experience that is
identical to what a viewer would experience when viewing a real environment. Radiosity …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

BSP trees have been shown to provide an effective representation of polyhedra through the
use of spatial subdivision, and are an alternative to the topologically based b-reps. While …

Bounding volume hierarchies (BVHs) have been used widely in collision detection
algorithms. The most commonly used bounding volume types are axis-aligned bounding …

Real‐time crowd visualization has recently attracted quite an interest from the graphics
community and, asinteractive applications become even more complex, there is a natural …

Quadtrees are hierarchical spatial tree data structures that are based on the principle of
recursive decomposition of space. The term quadtree originated from representation of two …

The objective of solid modeling is to represent, manipulate and reason about the 3D shape
of solid physical objects by computer. Such representations should be unambiguous. Solid …

In this paper we introduce the Brep-index, a new multidim. erssional space partitioning data
structure that pro-~) ides qrslck accr= ssto the vertices, edges and faces of a boundary …

One solution to the integration of additional characteristics, eg time and scale, into
geographic information system (GIS) datasets is to model them as extra geometric …

Visibility computation is crucial for computer graphics from its very beginning. The first
visibility algorithms aimed to determine visible lines or surfaces in a synthesized image of a …