Sciweavers

514 search results - page 6 / 103
» Drawing a Graph in a Hypercube
Sort
View
JGAA
2008
100views more  JGAA 2008»
13 years 7 months ago
Convex Grid Drawings of Plane Graphs with Rectangular Contours
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex gr...
Kazuyuki Miura, Akira Kamada, Takao Nishizeki
GD
2006
Springer
13 years 11 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
GD
2003
Springer
14 years 18 days ago
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...
Colin Murray, Carsten Friedrich, Peter Eades
IV
2009
IEEE
128views Visualization» more  IV 2009»
14 years 2 months ago
Large Quasi-Tree Drawing: A Neighborhood Based Approach
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
Romain Bourqui, David Auber
APVIS
2006
13 years 8 months ago
Method for drawing intersecting clustered graphs and its application to web ontology language
We introduce a class of graphs called an intersecting clustered graph that is a clustered graph with intersections among clusters. We propose a novel method for nicely drawing the...
Hiroki Omote, Kozo Sugiyama