Kinetic data structures—a state of the art report
LJ Guibas - Proc. Workshop Algorithmic Found. Robot, 1998 - books.google.com
Suppose we are simulating a collection of continuously moving bodies, rigid or deformable,
whose instantaneous motion follows known laws. As the simulation proceeds, we are …
whose instantaneous motion follows known laws. As the simulation proceeds, we are …
[图书][B] Geometric tools for computer graphics
P Schneider, DH Eberly - 2002 - books.google.com
Do you spend too much time creating the building blocks of your graphics applications or
finding and correcting errors? Geometric Tools for Computer Graphics is an extensive …
finding and correcting errors? Geometric Tools for Computer Graphics is an extensive …
[图书][B] Collision detection in interactive 3D environments
G Van Den Bergen - 2003 - taylorfrancis.com
The heart of any system that simulates the physical interaction between objects is collision
detection-the ability to detect when two objects have come into contact. This system is also …
detection-the ability to detect when two objects have come into contact. This system is also …
V-Clip: Fast and robust polyhedral collision detection
B Mirtich - ACM Transactions On Graphics (TOG), 1998 - dl.acm.org
This article presents the Voronoi-clip, or V-Clip, collision detection alogrithm for polyhedral
objects specified by a boundary representation. V-Clip tracks the closest pair of features …
objects specified by a boundary representation. V-Clip tracks the closest pair of features …
Accelerated occlusion culling using shadow frusta
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 …
with large numbers of primitives and high depth complexity at interactive rates. However …
A brief overview of collision detection
R Weller, R Weller - New Geometric Data Structures for Collision Detection …, 2013 - Springer
Collision detection algorithms has been investigated since decades. Consequently, there
already exist a wide spectrum of different approaches. In this chapter, we give a broad …
already exist a wide spectrum of different approaches. In this chapter, we give a broad …
[PDF][PDF] Consistent solid and boundary representations from arbitrary polygonal data
TM Murali, TA Funkhouser - Proceedings of the 1997 symposium on …, 1997 - dl.acm.org
Consistent repreaentations of the boundary and interior of thredimensional solid objects are
required by applications ramging from interactive visualization to finite element analysis …
required by applications ramging from interactive visualization to finite element analysis …
[PDF][PDF] Hierarchical polygon tiling with coverage masks
N Greene - Proceedings of the 23rd annual conference on …, 1996 - dl.acm.org
We present a novel polygon tiling algorithm in which recursive subdivision of image space is
driven by coverage masks that classify a convex polygon as inside, outside, or intersecting …
driven by coverage masks that classify a convex polygon as inside, outside, or intersecting …
[PDF][PDF] Incremental algorithms for collision detection between solid models
Fast and accurate collision detection between general solid models is a fundamental
problem in solid modeling, robotics, animation and computer-simulated environments. Most …
problem in solid modeling, robotics, animation and computer-simulated environments. Most …
[PDF][PDF] Are we all in the same" bloat"?
J McGrenere, G Moore - Graphics interface, 2000 - researchgate.net
Abstract “Bloat”, a term that has existed in the technical community for many years, has
recently received attention in the popular press. The term has a negative connotation …
recently received attention in the popular press. The term has a negative connotation …