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...
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
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...
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...
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...