Restrict to: Header Title Order by: Expected citations Hubs Usage Date Try: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
110 documents found.
Order: number of citations.
OBB-Tree: A Hierarchical Structure for Rapid Interference.. - Gottschalk, Lin, Manocha (1996)
(Correct) (246 citations)
To Appear in Proceedings of ACM Siggraph'96 OBB-Tree: A Hierarchical Structure for Rapid
representation using oriented bounding boxes (OBB's)An OBB is a rectangular bounding box at an
using oriented bounding boxes (OBB's)An OBB is a rectangular bounding box at an arbitrary
ftp.cs.unc.edu/pub/users/gottscha/obbt.ps.gz
Efficient Collision Detection Using Bounding.. - Klosowski, Held.. (1996)
(Correct) (78 citations)
popular recently is the oriented bounding box (OBB)which surrounds an object with a bounding box
to three dimensions (resulting in a hierarchy of OBBs known as a "BOXTREE"for applications of
on a hierarchy of oriented bounding boxes, called "OBBTrees"implemented by Gottschalk, Lin, and Manocha
ams.sunysb.edu/pub/geometry/cd-tvcg-97.ps.gz
Efficient Collision Detection of Complex Deformable Models.. - van den Bergen (1998)
(Correct) (18 citations)
been shown to be slower than oriented bounding box (OBB) trees. In this paper, we describe a way to speed
test, are faster to build, and use less storage than OBB trees, AABB trees might be a reasonable choice for
are spheres [8, 5]oriented bounding boxes (OBBs) 4]and discreteorientation polytopes (DOPs) 6,
www.win.tue.nl/cs/tt/gino/solid/jgt98deform.ps
Rapid Collision Detection by Dynamically Aligned DOP-Trees - Zachmann (1998)
(Correct) (11 citations)
usage of the data structure. A comparison with OBB-trees indicates that DOP-trees as efficient in
detection time. Also, our DOP-Trees are compared to OBB-Trees. Finally, Section 6 draws some conclusions
a bounding box hierarchy based on oriented boxes (OBBs)Its box overlap test is much more expensive than
web.informatik.uni-bonn.de/II/ag-klein/people/zach/papers/vrais98.ps.gz
Dynamic Collision Detection in Virtual Reality Applications - Eckstein, Schömer (1999)
(Correct) (10 citations)
bounding box (AABB)oriented bounding box (OBB)and extend known techniques by simple but
[Qui94, Hub95, Pal95]AABB trees [Zac95, Zac97]OBB trees [Got96]k-DOP trees [Klo98, Zac98] or trees
for bounding objects such as spheres, AABBs or OBBs. The main eort has been made to speed up static
www.mpi-sb.mpg.de/~schoemer/publications/WSCG99.ps.gz
A Framework for Fast and Accurate Collision.. - Gregory, Lin.. (1999)
(Correct) (10 citations)
trees of tight-fitting oriented bounding box trees (OBBTrees) At run time, we use hybrid hierarchical
the probe. ffl Bounding Volume Hierarchy based on OBBTrees: An OBBTree is a bounding volume hierarchy
ffl Bounding Volume Hierarchy based on OBBTrees: An OBBTree is a bounding volume hierarchy [15] of
ftp.cs.unc.edu/pub/users/lin/vr99.ps.gz
Fast Collision Detection Using QuOSPO Trees - He (1999)
(Correct) (7 citations)
of two leading bounding volume structures: OBBs and k-dops. Our experiments and analysis
of the two leading bounding volumes trees: OBB and k-dop trees. This paper is organized in six
a bounding volume structure, and discusses OBBs and k-dops. In Section 4, we introduce the
www.bell-labs.com/user/taosong/ps/i3d/QUOSPO.ps.gz
Fast Penetration Depth Computation for Physically-based.. - Kim, Otaduy, Lin, Manocha (2002)
(Correct) (6 citations)
volume or traversal schemes. These include the OBB trees [Gottschalk et al. 1996]sphere trees
116. Gottschalk, S.Lin, M.And Manocha, D. 1996. Obbtree: A Hierarchical Structure For Rapid
www.cs.unc.edu/~youngkim/publication/SCA02.pdf
Collision Queries using Oriented Bounding Boxes - Gottschalk (2000)
(Correct) (6 citations)
explores the use of oriented bounding boxes (OBBs)which may be aligned with the underlying
geometry to fit more tightly. We believe that OBBs historically have been used less often because
often because previously known methods for testing OBBs for overlap were relatively expensive, good
www.cs.unc.edu/~stefan/main.ps.gz
Optimized View Frustum Culling Algorithms for Bounding Boxes - Assarsson, Möller (2000)
(Correct) (6 citations)
bounding box (AABB) and oriented bounding box (OBB) hierarchies. We exploit frame-to-frame coherency
volumes, but we only present results for AABBs and OBBs. In particular, we provide solutions which is 2
faster than other VFC algorithms for AABBs and OBBs, depending on the circumstances. 1 Introduction
www.ce.chalmers.se/staff/uffe/vfcullbox.pdf
A Transparent Method for Correlating Profiles with Source.. - Eugene Albert Gem (1999)
(Correct) (5 citations)
blocks (SBB table)a table of object basic blocks (OBB table)and a mapping from the OBB entries to the
basic blocks (OBB table)and a mapping from the OBB entries to the SBB entries. Routines which have
an entry in the database. For these routines, the OBB table will be empty. The SBB table corresponds to
www.cs.ucsb.edu/~ckrintz/papers/fdo2-albert.ps.gz
Minimal Hierarchical Collision Detection - Gabriel Zachmann University (2002)
(Correct) (5 citations)
k-d trees and octrees [PS90]R-trees [BKSS90]and OBB trees [AK89]For collision detection, sphere
oriented (i.e.non-axis-parallel) bounding boxes (OBBs)They also showed that an OBB tree converges more
bounding boxes (OBBs)They also showed that an OBB tree converges more rapidly to the shape of the
www.cg.cs.uni-bonn.de/docs/publications/2002/zachmann-2002-minimal-extended.ps.gz
Computer Aided Motion: Move3D within MOLOG - Siméon, Laumond, Van.. (2001)
(Correct) (5 citations)
the first stage. A hierarchical structure based onto OBB-trees is constructed on top of the convex
12] S. Gootschalk, M.C. Lin and D. Manocha. OBBTree: A hierarchical structure for rapid
www.laas.fr/~nic/Papers/icra01.ps.gz
H-COLLIDE: A Framework for Fast and Accurate.. - Gregory, Lin.. (1998)
(Correct) (5 citations)
www.cs.unc.edu/~geom/HCollide/HCollide.ps.gz
Dynamic Plane Shifting BSP Traversal - Stan Melax Bioware (2000)
(Correct) (4 citations)
for our problem. Merging BSP trees [Naylor98]or OBB trees [Gottschalk96 ]does provide accurate
S. Gottschalk, M. C. Lin, D. Manocha. OBB-Tree: A Hierarchical Structure for Rapid
www.graphicsinterface.org/cgi-bin/DownloadPaper?name=2000/140/paper140.pdf
Efficient Collision Detection For Interactive 3D Graphics And.. - Klosowski (1998)
(Correct) (4 citations)
box (AABB)a sphere, an oriented bounding box (OBB)and a k-dop (where k =8)
popular recently is the oriented bounding box (OBB)which surrounds an object with a bounding box
to three dimensions (resulting in a hierarchy of OBBs known as a "BOXTREE"for applications of
ams.sunysb.edu/pub/geometry/jklosow/klosowski.ps.gz
V-COLLIDE: Accelerated Collision Detection for VRML - Hudson, Lin, Cohen.. (1997)
(Correct) (4 citations)
move, these VRML Scene Graph Sweep and Prune OBBTree Overlap Test Exact Primitive Intersection
transformations Overlapping AABB pairs Overlapping OBB pairs Colliding object pairs Figure 1: The
computes a tree of oriented bounding boxes OBBs) for every object, with a box containing the
www.cs.unc.edu/~walk/papers/hudson/vcol.ps
First 20 documents Next 20
Try your query at:
Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC