Every set of disjoint line segments admits a binary tree

Prosenjit Bose, Michael E. Houle, Godfried Toussaint

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist configurations of line segments where any such tree requires at least degree 3. We provide an O(n log n) time algorithm for constructing such a tree, and show that this is optimal.

Original languageEnglish (US)
Title of host publicationAlgorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
EditorsDing-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
PublisherSpringer Verlag
Pages20-28
Number of pages9
ISBN (Print)9783540583257
DOIs
StatePublished - 1994
Event5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China
Duration: Aug 25 1994Aug 27 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume834 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
CountryChina
CityBeijing
Period8/25/948/27/94

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Every set of disjoint line segments admits a binary tree'. Together they form a unique fingerprint.

Cite this