Summary: Edge Operations on Non­Crossing Spanning Trees \Lambda
Oswin Aichholzer y
Franz Aurenhammer
Institute for Theoretical Computer Science
Graz University of Technology
Graz, Austria
e­mail: foaich,aureng@igi.tu­graz.ac.at
Ferran Hurtado z
Departament de Matematica Aplicada II
Universitat Politecnica de Catalunya
Barcelona, Spain
e­mail: hurtado@ma2.upc.es
1 Introduction
Let S be a set of n points in the Euclidean plane,
and consider the set T S of all non­crossing span­
ning trees of S. (For each tree, its edges are
straight line segments which pairwise do not
cross.) A tree graph T G op
(S) is the graph that
has T S as its vertex set and that connects vertex

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universität Graz
Technische Universität Graz, Institute for Software Technology

Collections: Computer Technologies and Information Sciences