Sciweavers

335 search results - page 4 / 67
» Volume Queries in Polyhedra
Sort
View
VISSYM
2007
13 years 10 months ago
Subdivision Volume Splatting
Volumetric Subdivision (VS) is a powerful paradigm that enables volumetric sculpting and realistic volume deformations that give rise to the concept of "virtual clay". I...
Kevin T. McDonnell, Neophytos Neophytou, Klaus Mue...
EWC
2010
112views more  EWC 2010»
13 years 6 months ago
Meshing volumes with curved boundaries
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
Steve Oudot, Laurent Rineau, Mariette Yvinec
SMA
2003
ACM
123views Solid Modeling» more  SMA 2003»
14 years 21 days ago
Collision prediction for polyhedra under screw motions
The prediction of collisions amongst N rigid objects may be reduced to a series of computations of the time to first contact for all pairs of objects. Simple enclosing bounds and...
ByungMoon Kim, Jarek Rossignac
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 7 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
COMPGEOM
2006
ACM
14 years 1 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...