104 search results - page 1 / 21 » Tight Bounds for Point Recolouring |
CCCG
2006
13 years 6 months ago
2006
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
CCCG
2008
13 years 6 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
CCCG
2001
13 years 6 months ago
2001
We show that every set of n points in general position has a minimum pseudo-triangulation whose maximum vertex degree is five. In addition, we demonstrate that every point set in ...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
Gupta (SODA'01) considered the Steiner Point Removal (SPR) problem on trees. Given an edge-weighted tree T and a subset S of vertices called terminals in the tree, find an edg...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE