Documentation for the Graph Pyramid Drawing Application (bibtex)
by Adrian Ion Mabel Iglesias Ham, Walter G. Kropatsch
Abstract:
The aim of this document is to support an easy orientation in the application developed so far for the pyramid drawing problem. This application is based on an algorithm that uses paths by means of the equivalent contraction kernels to draw the edges. The drawing shows a planar graph which preserves topology but also geometry of the original image. Also, it can deal properly with the presence of multiple edges and self loops which commonly appear in the top level of irregular pyramids. Using only straight lines, the self loops would disappear and multiple edges overlap. The functionality of detecting and drawing a set of generators in the top of the pyramid has been added, by means of computing a fake new level by a last contraction using a spanning tree, and finally reconstructing the remaining loops in the previous last level. For supporting the studies to measure new topological invariants the edges have been classified in contracted, removed and surviving edges using a code of colors. Details about the input text file, set of classes, and comments about future work have been included.
Reference:
Documentation for the Graph Pyramid Drawing Application (Adrian Ion Mabel Iglesias Ham, Walter G. Kropatsch), Technical report, PRIP, TU Wien, 2008.
Bibtex Entry:
@TechReport{TR117,
  author =	 "Mabel Iglesias Ham, Adrian Ion and Walter G. Kropatsch",
  title =	 "Documentation for the Graph Pyramid Drawing Application",
  institution =	 "PRIP, TU Wien",
  number =	 "PRIP-TR-117",
  year =	 "2008",
  url =		 "ftp://ftp.prip.tuwien.ac.at/pub/publications/trs/tr117.pdf",
  abstract =	 "The aim of this document is to support an easy orientation in the application developed
so far for the pyramid drawing problem. This application is based on an algorithm that
uses paths by means of the equivalent contraction kernels to draw the edges. The drawing
shows a planar graph which preserves topology but also geometry of the original image.
Also, it can deal properly with the presence of multiple edges and self loops which commonly
appear in the top level of irregular pyramids. Using only straight lines, the self loops would
disappear and multiple edges overlap. The functionality of detecting and drawing a set of
generators in the top of the pyramid has been added, by means of computing a fake new
level by a last contraction using a spanning tree, and finally reconstructing the remaining
loops in the previous last level. For supporting the studies to measure new topological
invariants the edges have been classified in contracted, removed and surviving edges using
a code of colors. Details about the input text file, set of classes, and comments about future
work have been included.",
}
Powered by bibtexbrowser