Angles of arc-polygons and lombardi drawings of cacti
From MaRDI portal
Publication:6103170
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Abstract: 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 at most pi. 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 cycle of the cactus is a face of the drawing. However, there exist planar embeddings of cacti that do not have planar Lombardi drawings.
Recommendations
Cites work
- A Better Approximation Algorithm for Finding Planar Subgraphs
- A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
- An improved force-directed graph layout algorithm based on aesthetic criteria
- Approximating smooth planar curves by arc splines
- Approximation by polygons and polyhedra
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Bipartite and series-parallel graphs without planar Lombardi drawings
- Computational and structural advantages of circular boundary representation
- Drawing Graphs with Few Arcs
- Drawing planar graphs with circular arcs
- Drawing trees with perfect angular resolution and polynomial area
- Fixed-Location Circular Arc Drawing of Planar Graphs
- Force-directed Lombardi-style graph drawing
- Force-directed graph drawing using social gravity and scaling
- How to draw the minimum cuts of a planar graph
- Lombardi drawings of graphs
- Lombardi drawings of knots and links
- Mitered offsets and skeletons for circular arc polygons
- On the Geometry of Piecewise Circular Curves
- On the Number of Husimi Trees
- On the usability of Lombardi graph drawings
- Some results on greedy embeddings in metric spaces
- Triangulations with Circular Arcs
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs
This page was built for publication: Angles of arc-polygons and lombardi drawings of cacti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103170)
