Sciweavers

839 search results - page 14 / 168
» Three-Clustering of Points in the Plane
Sort
View
CCCG
2009
13 years 8 months ago
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...
Zachary Abel, Brad Ballinger, Prosenjit Bose, S&ea...
IJCV
2002
111views more  IJCV 2002»
13 years 7 months ago
Linear Multi View Reconstruction and Camera Recovery Using a Reference Plane
This paper presents a linear algorithm for simultaneous computation of 3D points and camera positions from multiple perspective views based on having a reference plane visible in a...
Carsten Rother, Stefan Carlsson
ICRA
2010
IEEE
134views Robotics» more  ICRA 2010»
13 years 6 months ago
Ground plane identification using LIDAR in forested environments
—To operate autonomously in forested environments, unmanned ground vehicles (UGVs) must be able to identify the load-bearing surface of the terrain (i.e. the ground). This paper ...
Matt W. McDaniel, Takayuki Nishihata, Christopher ...
CCCG
2008
13 years 9 months ago
On distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
Adrian Dumitrescu
TASE
2010
IEEE
13 years 2 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen