Trees with Convex Faces and Optimal Angles
DOI10.1007/978-3-540-70904-6_9zbMATH Open1185.68464OpenAlexW1639382724WikidataQ56001825 ScholiaQ56001825MaRDI QIDQ3595489FDOQ3595489
Authors: Josiah Carlson, David Eppstein 
Publication date: 28 August 2007
Published in: Graph Drawing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70904-6_9
Recommendations
- Convex extendable trees
- Convex envelopes on trees
- Angle and Distance Constraints on Tree Drawings
- Convex labelings of trees
- Trees in triangulations
- scientific article; zbMATH DE number 795222
- On trees of polygons
- scientific article; zbMATH DE number 4115560
- Geometry of plane trees
- Convexity in tree spaces
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (11)
- On turn-regular orthogonal representations
- Angle and Distance Constraints on Tree Drawings
- On the Hardness of Orthogonal-Order Preserving Graph Drawing
- Convex realizations of planar linear trees.
- How to draw free trees inside bounded rectilinear polygons
- On Turn-Regular Orthogonal Representations
- Realization and connectivity of the graphs of origami flat foldings
- Proximity drawings of high-degree trees
- Drawing trees with perfect angular resolution and polynomial area
- Optimal angular resolution for face-symmetric drawings
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
This page was built for publication: Trees with Convex Faces and Optimal Angles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595489)
