3 papers
cs.CG2018
Drawing a Rooted Tree as a Rooted Monotone Minimum Spanning Tree
Konstantinos Mastakas
Given a rooted point set , the rooted Monotone Minimum Spanning Tree (rooted MMST) of is the spanning geometric graph of in which all the vertices are connected…
cs.CG2018
Uniform 2D-Monotone Minimum Spanning Graphs
Konstantinos Mastakas
A geometric graph is monotone if each pair of vertices of is connected by a monotone path. We study the problem of producing the monotone spanning geometric…
cs.CG2016
Rooted Uniform Monotone Minimum Spanning Trees
Konstantinos Mastakas, Antonios Symvonis
We study the construction of the minimum cost spanning geometric graph of a given rooted point set where each point of is connected to the root by a path that satisfies a g…