Results 1  10
of
55
Polyhedral Visual Hulls for RealTime Rendering
 In Proceedings of Twelfth Eurographics Workshop on Rendering
, 2001
"... . We present new algorithms for creating and rendering visual hulls in realtime. Unlike voxel or sampled approaches, we compute an exact polyhedral representation for the visual hull directly from the silhouettes. This representation has a number of advantages: 1) it is a viewindependent represent ..."
Abstract

Cited by 138 (3 self)
 Add to MetaCart
. We present new algorithms for creating and rendering visual hulls in realtime. Unlike voxel or sampled approaches, we compute an exact polyhedral representation for the visual hull directly from the silhouettes. This representation has a number of advantages: 1) it is a viewindependent representation, 2) it is wellsuited to rendering with graphics hardware, and 3) it can be computed very quickly. We render these visual hulls with a viewdependent texturing strategy, which takes into account visibility information that is computed during the creation of the visual hull. We demonstrate these algorithms in a system that asynchronously renders dynamically created visual hulls in realtime. Our system outperforms similar systems of comparable computational power. 1
Determining the Separation of Preprocessed Polyhedra  A Unified Approach
, 1990
"... We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our emphasis is i) the uniform treatment of polyhedra separation problems, ii) the use of hierarchical representations of prim ..."
Abstract

Cited by 106 (5 self)
 Add to MetaCart
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our emphasis is i) the uniform treatment of polyhedra separation problems, ii) the use of hierarchical representations of primitive objects to provide implicit representations of composite or transformed objects, and iii) applications to natural problems in graphics and robotics. Among the specific results is an O(log jP j 1 log jQj) algorithm for determining the sepa ration of polyhedra P and Q (which have been individually preprocessed in at most linear time).
Fast proximity queries with swept sphere volumes
, 1999
"... We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown ..."
Abstract

Cited by 95 (18 self)
 Add to MetaCart
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some offset. The set of core primitive shapes includes a point, line, and rectangle. This family of bounding volumes provides varying tightness of t to the underlying geometry. Furthermore, we describe efficient and accurate algorithms to perform different queries using these bounding volumes. We present a novel analysis of proximity queries that highlights the relationship between collision detection and distance computation. We also present traversal techniques for accelerating distance queries. These algorithms have been used to perform proximity queries for applications including virtual prototyping, dynamic simulation, and motion planning on complex models. As compared to earlier algorithms based on bounding volume hierarchies for separation distance and approximate distance computation, our algorithms have
Incremental algorithms for collision detection between solid models
 IEEE Transactions on Visualization and Computer Graphics
, 1995
"... solid models ..."
Accelerated occlusion culling using shadow frusta
 In Proc. of ACM Symposium on Computational Geometry
, 1997
"... Many applications in computer graphics and virtual environments need to render datasets with large numbers of primitives and high depth complexity at interactive rates. However, standard techniques like view frustum culling and a hardware zbuffer are unable to display datasets composed of hundred o ..."
Abstract

Cited by 73 (9 self)
 Add to MetaCart
Many applications in computer graphics and virtual environments need to render datasets with large numbers of primitives and high depth complexity at interactive rates. However, standard techniques like view frustum culling and a hardware zbuffer are unable to display datasets composed of hundred of thousands of polygons at interactive frame rates on current highend graphics systems. We add a "conservative' ' visibility culling stage to the rendering pipeline, attempting to identify and avoid processing of occluded polygons. Given a moving viewpoint, the algorithm dynamically chooses a set of occluder3. Each occluder is used to compute a 3h.adow frustum, and all primitives contained within this frustum are culled. The algorithm hierarchically traverses the model, culling out parts not visible from the current viewpoint using efficient, robust, and in some cases specialized interference detection algorithms. The algorithm's performance varies with the location of the viewpoint and the depth complexity of the model. In the worst case it is linear in the input size with a small constant. In this paper, we demonstrate its performance on a city model composed of 500,000 polygons and possessing varying depth complexity. We are able to cull an average of 55 % of the polygons that would not be culled by viewfrustum culling and obtain a commensurate improvement in frame rate. The overall approach is ejJecti11e and â€¢calable, is applicable to all polygonal models, and can be easily implemented on top of viewfrustum culling. 1
Approximate Nearest Neighbor Queries Revisited
, 1998
"... This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in ddimensional Euclidean space. For any fixed constant d, a data structure with O(" (1\Gammad)=2 n log n) preprocessing time and O(" (1\Gammad)=2 log n) query time achieves approximation factor ..."
Abstract

Cited by 55 (3 self)
 Add to MetaCart
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in ddimensional Euclidean space. For any fixed constant d, a data structure with O(" (1\Gammad)=2 n log n) preprocessing time and O(" (1\Gammad)=2 log n) query time achieves approximation factor 1 + " for any given 0 ! " ! 1; a variant reduces the "dependence by a factor of " \Gamma1=2 . For any arbitrary d, a data structure with O(d 2 n log n) preprocessing time and O(d 2 log n) query time achieves approximation factor O(d 3=2 ). Applications to various proximity problems are discussed. 1 Introduction Let P be a set of n point sites in ddimensional space IR d . In the wellknown post office problem, we want to preprocess P into a data structure so that a site closest to a given query point q (called the nearest neighbor of q) can be found efficiently. Distances are measured under the Euclidean metric. The post office problem has many applications within computational...
Fast Distance Queries with Rectangular Swept Sphere Volumes
 Proc. of IEEE Int. Conference on Robotics and Automation
, 2000
"... : We present new distance computation algorithms using hierarchies of rectangular swept spheres. Each bounding volume of the tree is described as the Minkowski sum of a rectangle and a sphere, and fits tightly to the underlying geometry. We present accurate and efficient algorithms to build the hier ..."
Abstract

Cited by 51 (13 self)
 Add to MetaCart
: We present new distance computation algorithms using hierarchies of rectangular swept spheres. Each bounding volume of the tree is described as the Minkowski sum of a rectangle and a sphere, and fits tightly to the underlying geometry. We present accurate and efficient algorithms to build the hierarchies and perform distance queries between the bounding volumes. We also present traversal techniques for accelerating distance queries using coherence and priority directed search. These algorithms have been used to perform proximity queries for applications including virtual prototyping, dynamic simulation, and motion planning on complex models. As compared to earlier algorithms based on bounding volume hierarchies for separation distance and approximate distance computation, our algorithms have achieved significant speedups on many benchmarks. 1
Optimal OutputSensitive Convex Hull Algorithms in Two and Three Dimensions
, 1996
"... We present simple outputsensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worstcase optimal O(n log h) time and O(n) space, where h denotes the number of vertices of the convex hull. ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
We present simple outputsensitive algorithms that construct the convex hull of a set of n points in two or three dimensions in worstcase optimal O(n log h) time and O(n) space, where h denotes the number of vertices of the convex hull.
Controlled Simplification of Genus for Polygonal Models
, 1997
"... Genusreducing simplifications are important in constructing multiresolution hierarchies for levelofdetailbased rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genusreducing simplification approach that is complementary to the exis ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
Genusreducing simplifications are important in constructing multiresolution hierarchies for levelofdetailbased rendering, especially for datasets that have several relatively small holes, tunnels, and cavities. We present a genusreducing simplification approach that is complementary to the existing work on genuspreserving simplifications. We propose a simplification framework in which genusreducing and genuspreserving simplifications alternate to yield much better multiresolution hierarchies than would have been possible by using either one of them. In our approach we first identify the holes and the concavities by extending the concept of # hulls to polygonal meshes under the L1 distance metric and then generate valid triangulations to fill them. CR Categories and Subject Descriptors: I.3.3 [Computer Graphics]: Picture/Image Generation  Display algorithms; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling  Curve, surface, solid, and object represent...
Faster Construction of Planar Twocenters
, 1997
"... Improving on a recent breakthrough of Sharir, we find two minimumradius circular disks covering a planar point set, in randomized expected time O(n log 2 n). 1 Introduction The kcenter problem for a point set S is to find k points (called centers, usually not required to be a subset of S) such ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
Improving on a recent breakthrough of Sharir, we find two minimumradius circular disks covering a planar point set, in randomized expected time O(n log 2 n). 1 Introduction The kcenter problem for a point set S is to find k points (called centers, usually not required to be a subset of S) such that the maximum distance from any point in S to the nearest center is minimized. A case of particular interest is the planar twocenter problem [4], which can be viewed less abstractly as one of covering a set of points in the plane by two congruent circular disks, in such a way as to minimize the radius r # of the disks. For a long time the best algorithms for this problem had time bounds of the form O(n 2 log c n) [1, 5, 12, 11]. In a recent breakthrough, Sharir [16] greatly improved all of these algorithms, giving a twocenter algorithm with running time O(n log c n). The basic idea is to search for different types of partition depending on the relative positions of the two disk...