2 search results - page 1 / 1 » Taking a Walk in a Planar Arrangement |
FOCS
1999
IEEE
13 years 9 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
ICRA
2000
IEEE
13 years 8 months ago
2000
IEEE
This paper describes the progress of the BIP2000 project. This project, in which four laboratories are involved for 4 years, as uimed at the realization of the lower part of an an...