Sciweavers

525 search results - page 82 / 105
» Bidimensionality and geometric graphs
Sort
View
STACS
2001
Springer
15 years 4 months ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
CVPR
2000
IEEE
15 years 4 months ago
Geodesic Distance Evolution of Surfaces: A New Method for Matching Surfaces
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
Hussein M. Yahia, Etienne G. Huot, Isabelle Herlin...
CORR
2010
Springer
134views Education» more  CORR 2010»
14 years 12 months ago
Incremental Sampling-based Algorithms for Optimal Motion Planning
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
Sertac Karaman, Emilio Frazzoli
MVA
2008
14 years 11 months ago
Retrieving articulated 3-D models using medial surfaces
Abstract We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components an...
Kaleem Siddiqi, Juan Zhang, Diego Macrini, Ali Sho...
DCG
2002
106views more  DCG 2002»
14 years 11 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky