3D Modeling and Rendering White Papers
Planar Graphs with Topological Constraints
Overview This paper addresses the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cycle of the given graph and a set of its edges to be embedded inside this cycle and a set of its edges to be embedded outside this cycle. Their practical importance in graph visualization applications is due to the capability of supporting the semantics of graphs. Additionally, embedding algorithms for planar graphs with topological constraints can be combined with planar graph drawing algorithms that transform a given embedding into a topology preserving drawing according to particular drawing conventions and aesthetic criteria.
| Publisher | Brown University | File Format | PDF, requires Acrobat Rdr 5 |
|---|---|---|---|
| Date Published | March 2001 | Downloads | 143 |
| Format | White Papers | ||
| Topics | |||
-
Did you find this white paper useful?
White Paper RSS
Download
Register
