2877 search results - page 39 / 576 » The Complexity of Planarity Testing |
ENTCS
2007
13 years 9 months ago
2007
Several model-checker based methods to automated test-case generation have been proposed recently. The performance and applicability largely depends on the complexity of the model...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— Vision systems are used more and more in ’personal’ robots interacting with humans, since semantic information about objects and places can be derived from the rich...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— This paper presents a metric-based matching algorithm to estimate the robot planar displacement by matching dense two-dimensional range scans. The contribution is a geometric d...
ICAPR
2005
Springer
14 years 2 months ago
2005
Springer
This paper presents a method for accurately segmenting moving container trucks in image sequences. This task allows to increase the performance of a recognition system that must id...
GD
2007
Springer
14 years 26 days ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...