Corpus ID: 235765573

Angles of Arc-Polygons and Lombardi Drawings of Cacti

@inproceedings{Eppstein2021AnglesOA,
  title={Angles of Arc-Polygons and Lombardi Drawings of Cacti},
  author={David Eppstein and Daniel Frishberg and Martha C. Osegueda},
  booktitle={CCCG},
  year={2021}
}
We characterize the triples of interior angles that are possible in non-self-crossing triangles with circular-arc sides, and we prove that a given cyclic sequence of angles can be realized by a non-self-crossing polygon with circular-arc sides whenever all angles are ≤ π. As a consequence of these results, we prove that every cactus has a planar Lombardi drawing (a drawing with edges depicted as circular arcs, meeting at equal angles at each vertex) for its natural embedding in which every… Expand

Figures from this paper

References

SHOWING 1-10 OF 36 REFERENCES
Planar and Poly-Arc Lombardi Drawings
TLDR
This work gives an example of a planar 3-tree that has no planar Lombardi drawing and shows that all outerpaths do have a planars Lombardi Drawing, and generalizes the notion of Lombardi drawings to that of (smooth) $k-Lombardi drawings, in which each edge may be drawn as a (differentiable) sequence of circular arcs. Expand
Drawing Planar Graphs with Circular Arcs
TLDR
This paper presents a lower bound on the area of drawings in which edges are drawn using exactly one circular arc, and gives an algorithm for drawing n-vertex planar graphs such that the edges are sequences of two continuous circular arcs. Expand
Fixed-Location Circular Arc Drawing of Planar Graphs
TLDR
This paper considers 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 n points on the plane, and presents an improved O(n 7/4 polylog n) time algorithm and two optimization versions of the problem that are also NP-Hard. Expand
Drawing Graphs with Few Arcs
TLDR
Algorithms for constructing composite arc-drawings for trees, series-parallel graphs, planar 3-trees and general planar graphs are presented and a lower bound for the maximal size of the arrangement’s ground set is provided. Expand
Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
TLDR
A family of planar bipartite graphs all of whose Lombardi drawings are nonplanar are found, including series-parallel graphs and apex-trees for which there is no planar Lombardi drawing consistent with the given embedding. Expand
How to draw the minimum cuts of a planar graph
TLDR
This work shows how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts in a planar drawing in a bend-minimum orthogonal drawings. Expand
Arc diagrams, flip distances, and Hamiltonian triangulations
TLDR
It is shown that every triangulation (maximal planar graph) on n ≥ 6 vertices can be flipped into a Hamiltonian triangulated using a sequence of less than n / 2 combinatorial edge flips, which improves the upper bound on the diameter of the flip graph of combinatorials triangulations on n vertices. Expand
Approximation by polygons and polyhedra
In order to investigate as to what order of magnitude a plane (or a skew) curve can be approximated by w-sided polygons, we have to start from a definition of the deviation. One of the usualExpand
On the Geometry of Piecewise Circular Curves
In this article we would like to promote a class of plane curves that have a number of special and attractive properties, the piecewise circular curves, or PC curves. (We feel constrained to pointExpand
Lombardi Drawings of Graphs
TLDR
Algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs are described. Expand
...
1
2
3
4
...