A winding angle summation approach to the point-in-polygon problem is considered. The winding angle summation is backward stable and resistant to possible gaps between subsequent edges. A precomputed bounding volume hierarchy can be used to accelerate point queries for winding angle summation. The main theorem states that a BVH-accelerated point query takes no longer than O ( K log n K ) time i...

Coherence denotes similarities between items or entities. It describes the extent to which these items or entities are locally constant. An introduction to coherence and a survey of various types of coherence, that are used in computer graphics, are given. Techniques and data structures for exploiting coherence in computer graphics are described. Incremental techniques, bounding volume schemes,...

We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality for speed. Our algorithm yields an estimation of the quality, so that applications can specify the desired quality. In a timecritical system, applications can specify the maximum time budget instead, and quantitatively...

2 Detecting moving objects When we use a PTZ camera and background subtraction to detect moving objects, we must synchronize the PTZ of the camera and the PTZ of the background image. This paper describes a method a new method of detecting moving objects with an omnidirectional camera. The proposed method uses a fixed omnidirectional camera which can acquire images surrounding the camera, and b...

In this paper, we describe strategies for bounding volume hierarchy updates for ray tracing of deformable models. By using pre-built hierarchy structures and a lazy evaluation technique for updating the bounding volumes, the hierarchy reconstruction can be made very efficiently. Experiments show that for deforming triangle meshes the reconstruction time of the bounding volume hierarchies per fr...

Collision detection is an important aspect in many real-time simulation environments. Due to its nature of high Computation involved, collision detection can contribute to the bottleneck on the system involving large number of interacting objects. This paper focuses on finding options to efficiently cull away object pairs that are not likely to collide in large-scale dynamic rigid-body simulati...

Hair and fur typically consist of a large number of thin, curved, and densely packed strands which are difficult to ray trace efficiently. A tight fitting spatial data structure, such as a bounding volume hierarchy (BVH), is needed to quickly determine which hair a ray hits. However, the large number of hairs can yield a BVH with a large memory footprint (particularly when hairs are pre-tessell...

In this paper we present an algorithm for 3-D orthogonal drawing of arbitrary degree n-vertex m-edge multigraphs with O(m 2 = p n) bounding box volume and 6 bends per edge route. This is the smallest known bound on the bounding box volume of 3-D orthogonal multigraph drawings. We continue the study of the tradeoo between bounding box volume and the number of bends in orthogonal graph drawings t...

We present a new conservative image-based occlusion culling method to increase the speed of hardware accelerated rendering of very complex general scenes which may consist of millions of polygons without time-expensive preprocessing. The method is based on a lowresolution grid upon a conventional z-buffer or an occlusion-buffer. This grid is updated in a lazy manner which reduces the number of ...

Principal component analysis (PCA) is commonly used to compute a bounding box of a point set in R. The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimumvolume bounding boxes. We present examples of discrete points sets in the plane, showing that the worst case ratio of the volume of the PCA bou...