K. Mastakas

collaborators

Showing cs.CGShow all

3 papers · 1 filter

cs.CG2018

Drawing a Rooted Tree as a Rooted $y -$ Monotone Minimum Spanning Tree

Konstantinos Mastakas

Given a rooted point set $P$ , the rooted $y -$ Monotone Minimum Spanning Tree (rooted $y -$ MMST) of $P$ is the spanning geometric graph of $P$ in which all the vertices are connected…

cs.CG2018

Uniform 2D-Monotone Minimum Spanning Graphs

Konstantinos Mastakas

A geometric graph $G$ is $x y -$ monotone if each pair of vertices of $G$ is connected by a $x y -$ monotone path. We study the problem of producing the $x y -$ 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 $P$ where each point of $P$ is connected to the root by a path that satisfies a g…

Drawing a Rooted Tree as a Rooted y−Monotone Minimum Spanning Tree

Uniform 2D-Monotone Minimum Spanning Graphs

Rooted Uniform Monotone Minimum Spanning Trees

Drawing a Rooted Tree as a Rooted $y -$ Monotone Minimum Spanning Tree