34 search results - page 6 / 7 » Orthogonal Drawings of Plane Graphs without Bends |
102
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
GD
2003
Springer
15 years 4 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
102
click to vote
GD
2005
Springer
15 years 5 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
100
click to vote
SOFTVIS
2003
ACM
15 years 4 months ago
2003
ACM
UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is...