335 search results - page 1 / 67 » Volume Queries in Polyhedra |
86
Voted
JCDCG
2000
Springer
15 years 1 months ago
2000
Springer
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
78
Voted
DCG
1998
14 years 9 months ago
1998
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis...
ICALP
1990
Springer
15 years 1 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
DAGSTUHL
2000
14 years 11 months ago
2000
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...