Results 1  10
of
1,150
3D Collision Detection: A Survey
 Computers and Graphics
, 2000
"... Many applications in Computer Graphics require fast and robust 3D collision detection algorithms. These algorithms can be grouped into four approaches: spacetime volume intersection, swept volume interference, multiple interference detection and trajectory parameterization. While some approaches ar ..."
Abstract

Cited by 127 (4 self)
 Add to MetaCart
Many applications in Computer Graphics require fast and robust 3D collision detection algorithms. These algorithms can be grouped into four approaches: spacetime volume intersection, swept volume interference, multiple interference detection and trajectory parameterization. While some approaches
Stochastic Geometry and Wireless Networks, Volume I: Thepory
, 2009
"... A wireless communication network can be viewed as a collection of nodes, located in some domain, which can in turn be transmitters or receivers (depending on the network considered, nodes may be mobile users, base stations in a cellular network, access points of a WiFi mesh etc.). At a given time, ..."
Abstract

Cited by 251 (35 self)
 Add to MetaCart
from a point decays in an isotropic way with Euclidean distance, the geometry of the locations of the nodes plays a key role since it determines the signal to interference and noise ratio (SINR) at each receiver and hence the possibility of establishing simultaneously this collection of links at a
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 127 (20 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
Swept Volumes
"... 3 Given a solid S ⊂ R with a piecewise smooth boundary, we compute an approximation of the boundary surface of the volume which is swept by S under a smooth oneparameter motion. Using knowledge from kinematical and elementary differential geometry, the algorithm computes a set of points plus surfac ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
3 Given a solid S ⊂ R with a piecewise smooth boundary, we compute an approximation of the boundary surface of the volume which is swept by S under a smooth oneparameter motion. Using knowledge from kinematical and elementary differential geometry, the algorithm computes a set of points plus
The Swept Surface of an Elliptic Cylinder
"... In this paper, we present a method for computing a piecewise linear approximation to the surface swept by a moving, rotating elliptic cylinder. Our method is a generalization of the imprint point method we developed for computing points on a surface of revolution. The method is based on on identifyi ..."
Abstract
 Add to MetaCart
detection of moving machinery such as robots. It is anticipated that a robot would be modeled as a collection of components enclosed in elliptic cylinders, cones, toruses and spheres. Our method can be used to generate the swept volume of these enclosing objects, and used for interference detection
ImageSwept Volumes
, 2002
"... Many graphical objects can be represented by swept volumes (including its subset  generalised cylinders) by sweeping 2D or 3D templates along 3D trajectories. In this paper, we present a new approach for constructing swept volumes using image templates. We utilise scalar fields as our underlying d ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
Many graphical objects can be represented by swept volumes (including its subset  generalised cylinders) by sweeping 2D or 3D templates along 3D trajectories. In this paper, we present a new approach for constructing swept volumes using image templates. We utilise scalar fields as our underlying
Computing swept volumes
 Journal of Visualization and Computer Animation
, 1997
"... The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object (g ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
The swept volume problem is practical, dif®cult and interesting enough to have received a great deal of attention over the years, and the literature contains much discussion of methods for computing swept volumes in many situations. The method presented here permits an arbitrary polyhedral object
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 65 (14 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
Swept Volumes: Foundations, Perspectives, and Applications
"... Several fundamental developments in the past decade have led to a better understanding of swept volumes. While the underlying formulation for characterizing the volume generated as a result of the motion of a geometric entity in space has appeared in various fields under different names, this review ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
Several fundamental developments in the past decade have led to a better understanding of swept volumes. While the underlying formulation for characterizing the volume generated as a result of the motion of a geometric entity in space has appeared in various fields under different names
Swept volume with selfintersection for ®veaxis ballend milling
"... Abstract: The generation of a volume swept by a tool along its path, called the swept volume, is indispensable for the volumetric simulation of ®veaxis machining. In some cases of ®veaxis machining, the swept volume may be selfintersecting, which requires special processing to handle the geometri ..."
Abstract
 Add to MetaCart
Abstract: The generation of a volume swept by a tool along its path, called the swept volume, is indispensable for the volumetric simulation of ®veaxis machining. In some cases of ®veaxis machining, the swept volume may be selfintersecting, which requires special processing to handle
Results 1  10
of
1,150