Sciweavers

172 search results - page 4 / 35
» Planar Graphs with Topological Constraints
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 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
CVPR
2007
IEEE
14 years 1 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...
IV
2006
IEEE
117views Visualization» more  IV 2006»
14 years 1 months ago
Metabolic network visualization using constraint planar graph drawing algorithm
Romain Bourqui, David Auber, Vincent Lacroix, Fabi...
ICRA
2005
IEEE
118views Robotics» more  ICRA 2005»
14 years 1 months ago
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
— This paper presents an approach for haptic rendering of topological constraints to users operating serial virtual linkages. In the proposed approach, a haptic device controller...
Daniela Constantinescu, S. E. Salcudean, Elizabeth...
PODS
2004
ACM
110views Database» more  PODS 2004»
14 years 7 months ago
A Characterization of First-Order Topological Properties of Planar Spatial Data
d abstract) Michael Benedikt Bell Labs Jan Van den Bussche Limburgs Universitair Centrum Christof L?oding Lehrstuhl Informatik VII RWTH Aachen Thomas Wilke Institut f?ur Informatik...
Christof Löding, Jan Van den Bussche, Michael...