Reconstruction of the Geometric Structure of a Set of Points in the Plane from Its Geometric Tree Graph

Let P be a finite set of points in general position in the plane. The structure of the complete graph K ( P ) as a geometric graph includes, for any pair [ a ,  b ], [ c ,  d ] of vertex-disjoint edges, the information whether they cross or not. The simple (i.e., non-crossing) spanning trees (SSTs)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete & computational geometry 2016-04, Vol.55 (3), p.610-637
Hauptverfasser:	Keller, Chaya, Perles, Micha A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Automorphisms Combinatorics Computational Mathematics and Numerical Analysis Geometric trees Geometry Graph theory Graphs Mathematical analysis Mathematics Mathematics and Statistics Planes Segments Stars
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!