Sciweavers

DCG
1998
53views more  DCG 1998»
13 years 11 months ago
Motion Planning in Environments with Low Obstacle Density
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...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
DCG
1998
66views more  DCG 1998»
13 years 11 months ago
The Volume as a Metric Invariant of Polyhedra
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....
Idzhad Kh. Sabitov
DCG
1998
80views more  DCG 1998»
13 years 11 months ago
Fitting a Set of Points by a Circle
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...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
DCG
1998
59views more  DCG 1998»
13 years 11 months ago
A Probabilistic Analysis of the Power of Arithmetic Filters
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
Olivier Devillers, Franco P. Preparata
DCG
1998
59views more  DCG 1998»
13 years 11 months ago
Piercing d -Intervals
Noga Alon