Trees with Convex Faces and Optimal Angles

Simple item page
dc.creatorCarlson, Josiah
dc.creatorEppstein, David
dc.date2006-07-26
dc.date.accessioned2026-07-07T07:16:24Z
dc.date.available2026-07-07T07:16:24Z
dc.descriptionWe consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular resolution of the drawing. We find linear time algorithms for solving this problem, both for plane trees and for trees without a fixed embedding. In any such drawing, the edge lengths may be set independently of the angles, without crossing; we describe multiple strategies for setting these lengths.
dc.description12 pages, 10 figures. To appear at 14th Int. Symp. Graph Drawing, 2006
dc.identifierhttps://arxiv.org/abs/cs/0607113
dc.identifierhttp://arxiv.org/abs/cs/0607113
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113576
dc.subjectComputational Geometry
dc.subjectF.2.2
dc.titleTrees with Convex Faces and Optimal Angles
dc.typetext

Files

Collections

arXiv