1486 search results - page 132 / 298 » Algorithms for two-box covering |
130
click to vote
IJRR
2002
15 years 3 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
116
click to vote
IJRR
2002
15 years 3 months ago
2002
Exact cellular decompositions represent a robot's free space by dividing it into regions with simple structure such that the sum of the regions fills the free space. These de...
138
click to vote
JMLR
2002
15 years 3 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
168
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
138
click to vote
TVCG
1998
15 years 3 months ago
1998
—Recently, multiresolution visualization methods have become an indispensable ingredient of real-time interactive postprocessing. The enormous databases, typically coming along w...