Sciweavers

2877 search results - page 117 / 576
» The Complexity of Planarity Testing
Sort
View
IROS
2007
IEEE
138views Robotics» more  IROS 2007»
15 years 10 months ago
Obstacle detection from IPM and super-homography
— We present in this article a simple method to estimate an IPM view from an embedded camera. The method is based on the tracking of the road markers assuming that the road is lo...
Nicolas Simond, Michel Parent
118
Voted
IROS
2006
IEEE
135views Robotics» more  IROS 2006»
15 years 10 months ago
Toward Legless Locomotion Control
— Motivated by an error-recovery locomotion problem, we propose a control technique for a complex mechanical system by decomposing the system dynamics into a collection of simpli...
Ravi Balasubramanian, Alfred A. Rizzi, Matthew T. ...
DIAGRAMS
2004
Springer
15 years 9 months ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud
RT
2001
Springer
15 years 8 months ago
Opacity Shadow Maps
Opacity shadow maps approximate light transmittance inside a complex volume with a set of planar opacity maps. A volume made of standard primitives (points, lines, and polygons) i...
Tae-Yong Kim 0002, Ulrich Neumann
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 8 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...