Filters








2 Hits in 2.4 sec

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs

Seok-Hee Hong, Peter Eades
<span title="2005-06-14">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qhi3z76be5c5xeihac5cyiid3m" style="color: black;">Algorithmica</a> </i> &nbsp;
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. This paper discusses symmetric drawings of oneconnected planar graphs.  ...  Finding planar automorphisms is the first and most difficult step in constructing planar symmetric drawings of graphs.  ...  There is a linear time algorithm that constructs maximally symmetric planar drawings of oneconnected planar graphs, with straight line edges.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-005-1149-y">doi:10.1007/s00453-005-1149-y</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ryrj4lgxkbg7faa5etiefasyf4">fatcat:ryrj4lgxkbg7faa5etiefasyf4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070903153018/http://www-test.it.usyd.edu.au/~visual/valacon/pdf/papers/Algorithmica06-OneConnectedPlanar.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/17/81174f6b435775fde974f73a53af4edfd3680a88.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00453-005-1149-y"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Testing Full Outer-2-planarity in Linear Time [chapter]

Seok-Hee Hong, Hiroshi Nagamochi
<span title="">2016</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The algorithm also produce a fully outer-2-planar embedding of a graph, if it exists. We also show that every fully-outer-2-planar embedding admits a straight-line drawing.  ...  Based on these properties, we present a linear-time algorithm for testing fully outer-2-planarity of a graph G, where G is triconnected, biconnected and oneconnected.  ...  [16] gave a linear-time testing and drawing algorithm to construct a straight-line 1-planar drawing, if it exists.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-53174-7_29">doi:10.1007/978-3-662-53174-7_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zoxr6flo2feflf4spugwo7gpym">fatcat:zoxr6flo2feflf4spugwo7gpym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190225210659/http://pdfs.semanticscholar.org/680b/5409f7aeb5f8d35fb947d3fcbb335884efd0.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/68/0b/680b5409f7aeb5f8d35fb947d3fcbb335884efd0.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-53174-7_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>