Sciweavers

140 search results - page 22 / 28
» On simultaneous planar graph embeddings
Sort
View
GD
1998
Springer
13 years 11 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
SIAMDM
2010
131views more  SIAMDM 2010»
13 years 1 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige
KIVS
2011
Springer
12 years 9 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
DIAGRAMS
2004
Springer
14 years 3 days ago
Ensuring the Drawability of Extended Euler Diagrams for up to 8 Sets
Abstract. This paper shows by a constructive method the existence of a diagrammatic representation called extended Euler diagrams for any collection of sets X1, ..., Xn , n < 9....
Anne Verroust, Marie-Luce Viaud
CGF
2007
157views more  CGF 2007»
13 years 6 months ago
Mesh Segmentation via Spectral Embedding and Contour Analysis
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...
Rong Liu, Hao Zhang 0002