Sciweavers

172 search results - page 19 / 35
» Planar Graphs with Topological Constraints
Sort
View
ICNP
2005
IEEE
14 years 3 months ago
Path Vector Face Routing: Geographic Routing with Local Face Information
Existing geographic routing algorithms depend on the planarization of the network connectivity graph for correctness, and the planarization process gives rise to a welldefined no...
Ben Leong, Sayan Mitra, Barbara Liskov
TVCG
2010
157views more  TVCG 2010»
13 years 8 months ago
Crease Surfaces: From Theory to Extraction and Application to Diffusion Tensor MRI
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
Thomas Schultz, Holger Theisel, Hans-Peter Seidel
INFOCOM
2007
IEEE
14 years 4 months ago
Face Tracing Based Geographic Routing in Nonplanar Wireless Networks
— Scalable and efficient routing is a main challenge in the deployment of large ad hoc wireless networks. An essential element of practical routing protocols is their accommodat...
Fenghui Zhang, Hao Li, Anxiao Jiang, Jianer Chen, ...
ICCV
2005
IEEE
14 years 11 months ago
3D Object Reconstruction from a Single 2D Line Drawing without Hidden Lines
The human vision system can interpret a single 2D line drawing as a 3D object without much difficulty even if the hidden lines of the object are invisible. Several reconstruction ...
Liangliang Cao, Jianzhuang Liu, Xiaoou Tang
ADHOC
2008
78views more  ADHOC 2008»
13 years 10 months ago
Asymptotic uniform data-rate guarantees in large wireless networks
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
Xin Liu, R. Srikant