Sciweavers

553 search results - page 9 / 111
» On Planar Path Transformation
Sort
View
IPL
2006
98views more  IPL 2006»
13 years 7 months ago
Transforming spanning trees and pseudo-triangulations
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
Oswin Aichholzer, Franz Aurenhammer, Clemens Hueme...
INFOCOM
2008
IEEE
14 years 1 months ago
Robust Planarization of Unlocalized Wireless Sensor Networks
Abstract—Wireless sensor networks need very efficient network protocols due to the sensors’ limited communication and computation capabilities. Network planarization – find...
Fenghui Zhang, Anxiao Jiang, Jianer Chen
AUTOMATICA
2010
119views more  AUTOMATICA 2010»
13 years 7 months ago
Path following for the PVTOL aircraft
This article presents a solution to the path following problem for the planar vertical take-off and landing aircraft (PVTOL) which is applicable to a class of smooth Jordan curves...
Luca Consolini, Manfredi Maggiore, Christopher Nie...
ICCV
2007
IEEE
14 years 1 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
COCOON
2009
Springer
14 years 1 months ago
Edge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
Therese C. Biedl, Michal Stern