Sciweavers

450 search results - page 15 / 90
» Quadrangulations of Planar Sets
Sort
View
ICRA
1999
IEEE
123views Robotics» more  ICRA 1999»
14 years 1 months ago
Planar Image Based Visual Servoing as a Navigation Problem
We describe a hybrid planar image-based servo algorithm which, for a simplified planar convex rigid body, converges to a static goal for all initial conditions within the workspac...
Noah J. Cowan, Daniel E. Koditschek
SODA
2001
ACM
105views Algorithms» more  SODA 2001»
13 years 10 months ago
Online point location in planar arrangements and its applications
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...
Sariel Har-Peled, Micha Sharir
DAGM
2007
Springer
14 years 1 months ago
Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts
We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the t...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 9 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora
ESA
2003
Springer
118views Algorithms» more  ESA 2003»
14 years 2 months ago
The Voronoi Diagram of Planar Convex Objects
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
Menelaos I. Karavelas, Mariette Yvinec