Sciweavers

999 search results - page 91 / 200
» Finding shapes in a set of points
Sort
View
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 3 months ago
On-line safe path planning in unknown environments
s - For the on-line safe path planning of a mobile robot in unknown environments, the paper proposes a simple Hopfield Neural Network ( HNN ) planner. Without learning process, the...
Weidong Chen, Changhong Fan, Yugeng Xi
CCCG
2006
14 years 11 months ago
(Approximate) Conic Nearest Neighbors and the induced Voronoi Diagram
For a given point set in Euclidean space we consider the problem of finding (approximate) nearest neighbors of a query point but restricting only to points that lie within a fixed...
Stefan Funke, Theocharis Malamatos, Domagoj Matije...
DCG
2008
86views more  DCG 2008»
14 years 10 months ago
Efficient Algorithms for Maximum Regression Depth
We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily...
Marc J. van Kreveld, Joseph S. B. Mitchell, Peter ...
COMGEO
2010
ACM
14 years 10 months ago
Centerpoints and Tverberg's technique
Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg's theorem, we show the following extension of the centerpoint th...
Abdul Basit, Nabil H. Mustafa, Saurabh Ray, Sarfra...
CVPR
2005
IEEE
15 years 12 months ago
On Modelling Nonlinear Shape-and-Texture Appearance Manifolds
Statistical shape-and-texture appearance models employ image metamorphosis to form a rich, compact representation of object appearance. They achieve their efficiency by decomposin...
Chris Mario Christoudias, Trevor Darrell