Sciweavers

436 search results - page 12 / 88
» Lombardi Drawings of Graphs
Sort
View
HCI
2007
13 years 11 months ago
Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs
A method of drawing anchored maps for bipartite graphs is presented. Suppose that the node set of a bipartite graph is divided into set A and set B. On an anchored map of the bipar...
Kazuo Misue
GD
2003
Springer
14 years 2 months ago
Selected Open Problems in Graph Drawing
Abstract. In this manuscript, we present several challenging and interesting open problems in graph drawing. The goal of the listing in this paper is to stimulate future research i...
Franz-Josef Brandenburg, David Eppstein, Michael T...
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 9 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
ICCAD
1996
IEEE
90views Hardware» more  ICCAD 1996»
14 years 1 months ago
A coloring approach to the structural diagnosis of interconnects
This paper presents a new approach for diagnosing stuck-at and short faults in interconnects whose layouts are known. This structural approach exploits dierent graph coloring and ...
Xiao-Tao Chen, Fabrizio Lombardi
GD
2007
Springer
14 years 3 months ago
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...