Sciweavers

568 search results - page 68 / 114
» Regular Polygon Detection
Sort
View
DCOSS
2007
Springer
13 years 11 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
BMVC
1997
13 years 8 months ago
Real-time Dynamic Deformable Meshes for Volumetric Segmentation and Visualisation
This paper presents a surface segmentation method which uses a simulated inflating balloon model to segment surface structure from volumetric data using a triangular mesh. The mod...
Richard Bowden, T. A. Mitchell, M. Sahardi
CGF
2008
144views more  CGF 2008»
13 years 7 months ago
High Performance GPU-based Proximity Queries using Distance Fields
Proximity queries such as closest point computation and collision detection have many applications in computer graphics, including computer animation, physics-based modeling, augm...
T. Morvan, M. Reimers, E. Samset
CGF
2006
136views more  CGF 2006»
13 years 7 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
CGF
2007
126views more  CGF 2007»
13 years 7 months ago
A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space
In this paper, we propose a robust and efficient Lagrangian approach for modeling dynamic interfaces between different materials undergoing large deformations and topology change...
Jean-Philippe Pons, Jean-Daniel Boissonnat