2877 search results - page 203 / 576 » The Complexity of Planarity Testing |
186
click to vote
ICRA
2006
IEEE
16 years 1 months ago
2006
IEEE
— The configuration space of a robot is partitioned into free space and C-obstacle space. Most of the prior work in collision detection and motion planning algorithms is targete...
202
click to vote
SIGGRAPH
2003
ACM
16 years 11 days ago
2003
ACM
The study of art history is an exciting and rewarding one, but one in which the student frequently encounters complex and difficult to understand concepts. Traditional methodologi...
229
click to vote
ICCV
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
164
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
226
click to vote
DCG
2008
15 years 7 months ago
2008
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...