Sciweavers

146 search results - page 26 / 30
» Structure from Planar Motions with Small Baselines
Sort
View
COMPGEOM
2009
ACM
14 years 1 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
ROBOCUP
2001
Springer
121views Robotics» more  ROBOCUP 2001»
13 years 11 months ago
A Control Method for Humanoid Biped Walking with Limited Torque
This paper presents an energy-ecient biped walking method that has been implemented in a low-cost humanoid platform, PINO, for various research purposes. For biped walking robots ...
Fuminori Yamasaki, Ken Endo, Minoru Asada, Hiroaki...
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
ECCV
2002
Springer
14 years 9 months ago
3D Modelling Using Geometric Constraints: A Parallelepiped Based Approach
In this paper, efficient and generic tools for calibration and 3D reconstruction are presented. These tools exploit geometric constraints frequently present in man-made environmen...
Marta Wilczkowiak, Edmond Boyer, Peter F. Sturm