839 search results - page 69 / 168 » Three-Clustering of Points in the Plane |
GD
2006
Springer
14 years 1 months ago
2006
Springer
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
CCCG
2007
13 years 11 months ago
2007
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
CCCG
2008
13 years 11 months ago
2008
We consider the problem of finding a shortest rectilinear Steiner tree for a given set of points in the plane in the presence of rectilinear obstacles that must be avoided. We ext...
CCCG
2006
13 years 11 months ago
2006
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at whi...
CCCG
2006
13 years 11 months ago
2006
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...