Sciweavers

1245 search results - page 98 / 249
» Triangulation for Points on Lines
Sort
View
IPL
2002
125views more  IPL 2002»
15 years 6 months ago
A note concerning the closest point pair algorithm
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
Martin Richards
TASE
2010
IEEE
15 years 1 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
CVPR
2000
IEEE
16 years 8 months ago
Zebra-Crossing Detection for the Partially Sighted
Zebra-crossings are useful road features for outdoor navigation in mobility aids for the partially sighted. In this paper, zebra-crossings are detected by looking for groups of co...
Stephen Se
IROS
2006
IEEE
156views Robotics» more  IROS 2006»
16 years 14 days ago
Decoupled Homography-based Visual Servoing with Omnidirectional Cameras
Abstract— This paper presents a new hybrid decoupled visionbased control scheme valid for the entire class of central catadioptric sensors (including conventional perspective cam...
Hicham Hadj-Abdelkader, Youcef Mezouar, Nicolas An...
RT
1997
Springer
15 years 10 months ago
Polyhedral Geometry and the Two-Plane Parameterization
Recently the light-field and lumigraph systems have been proposed as general methods of representing the visual information present in a scene. These methods represent this infor...
Xianfeng Gu, Steven J. Gortler, Michael F. Cohen