517 search results - page 5 / 104 » Separators in Two and Three Dimensions |
COMPGEOM
2004
ACM
15 years 2 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
65
Voted
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
106
click to vote
APVIS
2007
14 years 11 months ago
2007
Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main mem...
ICRA
1999
IEEE
15 years 1 months ago
1999
IEEE
This paper presents a new globally convergent rangesensor based navigation algorithm in three-dimensions, called 3DBug. The 3DBug algorithm navigates a point robot in a three-dime...
93
Voted
COMPGEOM
1998
ACM
15 years 1 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...