Growing a tree from its branches

Prosfenjit Bose, Godfried Toussaint

Research output: Contribution to journalArticle

Abstract

Given a set L of n disjoint line segments in the plane, we show that it is always possible to form a spanning tree of the endpoints of the segments, such that each line segment is an edge of the tree and the tree has no crossing edges. Such a tree is known as an encompassing tree and can be constructed in O(n log n) time when no three endpoints in L are collinear. In the presence of collinear endpoints, we show first that an encompassing tree with no crossing edges exists and can be computed in O(n2) time, and second that the maximum degree of a node in the minimum weight spanning tree formed by these line segments is seven, and that there exists a set of line segments achieving this bound. Finally, we show that the complexity of finding the minimum weight spanning tree is optimal Θ(n log n) when we assume that the endpoints of the line segments are in general position.

Original languageEnglish (US)
Pages (from-to)86-103
Number of pages18
JournalJournal of Algorithms
Volume19
Issue number1
DOIs
StatePublished - Jan 1 1995

Fingerprint

Line segment
Branch
Spanning tree
Collinear
Maximum Degree
Disjoint
Vertex of a graph

ASJC Scopus subject areas

  • Control and Optimization
  • Computational Theory and Mathematics
  • Computational Mathematics

Cite this

Growing a tree from its branches. / Bose, Prosfenjit; Toussaint, Godfried.

In: Journal of Algorithms, Vol. 19, No. 1, 01.01.1995, p. 86-103.

Research output: Contribution to journalArticle

Bose, Prosfenjit ; Toussaint, Godfried. / Growing a tree from its branches. In: Journal of Algorithms. 1995 ; Vol. 19, No. 1. pp. 86-103.
@article{50833911951f49d9887b26782ce55fca,
title = "Growing a tree from its branches",
abstract = "Given a set L of n disjoint line segments in the plane, we show that it is always possible to form a spanning tree of the endpoints of the segments, such that each line segment is an edge of the tree and the tree has no crossing edges. Such a tree is known as an encompassing tree and can be constructed in O(n log n) time when no three endpoints in L are collinear. In the presence of collinear endpoints, we show first that an encompassing tree with no crossing edges exists and can be computed in O(n2) time, and second that the maximum degree of a node in the minimum weight spanning tree formed by these line segments is seven, and that there exists a set of line segments achieving this bound. Finally, we show that the complexity of finding the minimum weight spanning tree is optimal Θ(n log n) when we assume that the endpoints of the line segments are in general position.",
author = "Prosfenjit Bose and Godfried Toussaint",
year = "1995",
month = "1",
day = "1",
doi = "10.1006/jagm.1995.1028",
language = "English (US)",
volume = "19",
pages = "86--103",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Growing a tree from its branches

AU - Bose, Prosfenjit

AU - Toussaint, Godfried

PY - 1995/1/1

Y1 - 1995/1/1

N2 - Given a set L of n disjoint line segments in the plane, we show that it is always possible to form a spanning tree of the endpoints of the segments, such that each line segment is an edge of the tree and the tree has no crossing edges. Such a tree is known as an encompassing tree and can be constructed in O(n log n) time when no three endpoints in L are collinear. In the presence of collinear endpoints, we show first that an encompassing tree with no crossing edges exists and can be computed in O(n2) time, and second that the maximum degree of a node in the minimum weight spanning tree formed by these line segments is seven, and that there exists a set of line segments achieving this bound. Finally, we show that the complexity of finding the minimum weight spanning tree is optimal Θ(n log n) when we assume that the endpoints of the line segments are in general position.

AB - Given a set L of n disjoint line segments in the plane, we show that it is always possible to form a spanning tree of the endpoints of the segments, such that each line segment is an edge of the tree and the tree has no crossing edges. Such a tree is known as an encompassing tree and can be constructed in O(n log n) time when no three endpoints in L are collinear. In the presence of collinear endpoints, we show first that an encompassing tree with no crossing edges exists and can be computed in O(n2) time, and second that the maximum degree of a node in the minimum weight spanning tree formed by these line segments is seven, and that there exists a set of line segments achieving this bound. Finally, we show that the complexity of finding the minimum weight spanning tree is optimal Θ(n log n) when we assume that the endpoints of the line segments are in general position.

UR - http://www.scopus.com/inward/record.url?scp=0012140328&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0012140328&partnerID=8YFLogxK

U2 - 10.1006/jagm.1995.1028

DO - 10.1006/jagm.1995.1028

M3 - Article

AN - SCOPUS:0012140328

VL - 19

SP - 86

EP - 103

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -