Degree constrained tree embedding into points in the plane

Akihisa Tamura, Yoshiko Tamura

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


Given a set N = {p1,...,pn} of n points in general position in the plane, and a positive integral n-vector d = (d1,...,dn) satisfying ∑ni=1di=2n - 2, can we construct a tree on N, such that the degree of point pi is di and none of the (n - 1) line segments connecting two points corresponding to endpoints of an edge intersect each other (except possibly at its endpoints)? We give a simple proof of the existence of such a tree in any instance and propose an algorithm polynomial on n for constructing one.

Original languageEnglish
Pages (from-to)211-214
Number of pages4
JournalInformation Processing Letters
Issue number4
Publication statusPublished - 1992 Dec 10
Externally publishedYes


  • Design of algorithms
  • combinatorial problems
  • degree sequences
  • embeddings
  • trees

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Degree constrained tree embedding into points in the plane'. Together they form a unique fingerprint.

Cite this