90 search results - page 6 / 18 » Obfuscated Drawings of Planar Graphs |
GD
1999
Springer
14 years 2 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...
CCCG
2007
13 years 11 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
GD
2003
Springer
14 years 3 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...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
GD
2007
Springer
14 years 4 months ago
2007
Springer