335 search results - page 3 / 67 » Volume Queries in Polyhedra |
VG
2003
13 years 8 months ago
2003
Finite element methods commonly use unstructured grids as the computational domain. As a matter of fact, the volume visualization of these unstructured grids is a time consuming t...
ER
2003
Springer
14 years 20 days ago
2003
Springer
In this paper we present a volume data model amenable to querying volumes in databases. Unlike most existing volume models, which are directed towards specific applications (notab...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of ray shooting in a three-dimensional scene consisting of k (possibly intersecting) convex polyhedra with a total of n facets. That is, we want to preproc...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
CGF
2008
13 years 7 months ago
2008
Given a 3D solid model S represented by a tetrahedral mesh, we describe a novel algorithm to compute a hierarchy of convex polyhedra that tightly enclose S. The hierarchy can be b...