6 search results - page 1 / 2 » dcg 1998 |
DCG
1998
13 years 4 months ago
1998
DCG
1998
13 years 4 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....
DCG
1998
13 years 4 months ago
1998
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
DCG
2010
13 years 4 months ago
2010
Abstract. The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. Th...
DCG
1998
13 years 4 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...