Pinning balloons with perfect angles and optimal area

@inproceedings{Halupczok2011PinningBW,
  title={Pinning balloons with perfect angles and optimal area},
  author={Immanuel Halupczok and Andr{\'e} Schulz},
  booktitle={J. Graph Algorithms Appl.},
  year={2011}
}
We study the problem of arranging a set of n disks with prescribed radii on n rays emanating from the origin such that two neighboring rays are separated by an angle of 2π/n. The center of the disks have to lie on the rays, and no two disk centers are allowed to lie on the same ray. We require that the disks have disjoint interiors, and that for every ray the segment between the origin and the boundary of its associated disk avoids the interior of the disks. Let $\widetilde r$ be the sum of the… 

Figures and Tables from this paper

Drawing Trees with Perfect Angular Resolution and Polynomial Area

The results explore what is achievable with straight-line drawings and what more is achieving with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution.

Declarative Expression and Optimization of Data-Intensive Flows

This work introduces a declarative way to specify flows, which is based on annotated descriptions of the output schema of each flow activity, that is adequate to capture both a wide-range of arbitrary data transformations and the precedence constraints between the various stages in the flow.

Visual Maps for Data-Intensive Ecosystems

This paper proposes a set of methods for providing visual maps of data-intensive ecosystems, model the ecosystem as a graph, with modules as nodes and data provision relationships as edges, and cluster the modules of the ecosystem in order to further highlight their interdependencies and reduce visual clutter.

A Bibliography of Papers in Lecture Notes in Computer Science (2012): Volumes 6121{7125

(∆ + 1) [1577]. (ρ,G) [266]. (r|p) [781]. 1 [1022]. 1 [1342]. 2 [27, 1294, 1138, 432, 1028, 281, 758, 272, 1440, 546, 861, 867, 1352, 578, 561]. 3 [579, 1293, 1381, 176, 1355, 1623, 1294, 1012, 1358,

References

SHOWING 1-10 OF 15 REFERENCES

On Balloon Drawings of Rooted Trees

An efficient algorithm to optimize angular resolution and aspect ratio for the balloon drawing of rooted unordered trees is designed and it is shown that this problem is reducible to the perfect matching problem for bipartite graphs, which is solvable in polynomial time.

Complexity analysis of balloon drawing for rooted trees

Tree Drawings on the Hexagonal Grid

An algorithm is provided for compacted straight–line drawings of penta trees on the hexagonal grid, such that the direction of the edges from a node to its children is given by the patterns and these edges have the same length.

A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees

Drawing with Fat Edges

The problem of drawing with "fat" edges, i.e., with edges of variable thickness, is introduced and a model for drawing with fat edges is presented and a corresponding efficient polynomial time algorithm that uses the model is presented.

On the angular resolution of planar graphs

A very natural linear program is analyzed that bounds the angular resolution of any fixed planar graph G from &OHgr;(1/<italic>d</italic>, although currently, it is unable to settle whether or not this lower bound is existentially tight (up to constant α).

Drawing Trees with Perfect Angular Resolution and Polynomial Area

The results explore what is achievable with straight-line drawings and what more is achieving with Lombardi-style drawings, with respect to drawings of trees with perfect angular resolution.

Straight-line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio

This paper investigates the area requirement of (non-upward) planar straight-line grid drawings of binary trees and shows that such a drawing can be constructed in O(n log n) time.

Bubble Tree Drawing Algorithm

It is shown that the Bubble Tree drawing algorithm provides a planar drawing with at most one bend per edge in linear running time.

Straight-Line Orthogonal Drawings of Binary and Ternary Trees

Algorithms for constructing orderpreserving straight-line orthogonal drawings of binary and ternary trees in O(n1.5) area and Ω(n2) area lower bounds, that prove to be tight, are presented.