Sciweavers

592 search results - page 61 / 119
» Crossing numbers of random graphs
Sort
View
GD
2005
Springer
14 years 1 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
13 years 6 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....
SI3D
2003
ACM
14 years 1 months ago
Large haptic topographic maps: marsview and the proxy graph algorithm
In this paper we develop an interactive 3D browser for large topographic maps using a visual display augmented by a haptic, or force feedback, display. The extreme size of our dat...
Sean P. Walker, John Kenneth Salisbury Jr.
VDA
2010
247views Visualization» more  VDA 2010»
13 years 10 months ago
Flow Web: a graph based user interface for 3D flow field exploration
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
Lijie Xu, Han-Wei Shen
ADHOCNOW
2005
Springer
14 years 1 months ago
Performance Analysis of the Hierarchical Layer Graph for Wireless Networks
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...
Stefan Rührup, Christian Schindelhauer, Klaus...