188 search results - page 2 / 38 » The 2-center problem in three dimensions |
COMPGEOM
1994
ACM
13 years 9 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
COMPGEOM
2008
ACM
13 years 7 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
COMPUTING
2008
13 years 5 months ago
2008
ICRA
1993
IEEE
13 years 9 months ago
1993
IEEE
We present an approach for solving the path planning problem for a mobile robot operating in an unknown, three dimensional environment containing obstacles of arbitrary shape. The...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...