We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...