Trees with Convex Faces and Optimal Angles

DOI10.1007/978-3-540-70904-6_9MaRDI QIDQ3595489zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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)

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

Cited in

(11)

• Optimal angular resolution for face-symmetric drawings
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
• On Turn-Regular Orthogonal Representations
• Proximity drawings of high-degree trees
• Realization and connectivity of the graphs of origami flat foldings
• On the Hardness of Orthogonal-Order Preserving Graph Drawing
• Angle and Distance Constraints on Tree Drawings
• Drawing trees with perfect angular resolution and polynomial area
• Convex realizations of planar linear trees.
• On turn-regular orthogonal representations
• How to draw free trees inside bounded rectilinear polygons

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)