CCCG
2001
13 years 6 months ago
2001
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
CCCG
2001
13 years 6 months ago
2001
This paper is concerned with applications of Tutte's barycentric embedding theorem (Proc. London Math. Soc. 13 (1963), 743
CCCG
2001
13 years 6 months ago
2001
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
CCCG
2001
13 years 6 months ago
2001
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 ...
CCCG
2001
13 years 6 months ago
2001
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. ...
CCCG
2001
13 years 6 months ago
2001
A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in gene...
CCCG
2001
13 years 6 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
CCCG
2001
13 years 6 months ago
2001
Local coordinates based on the Voronoi diagram are used in natural neighbour interpolation to quantify the "neighbourliness" of data sites. In an earlier paper, we have ...
CCCG
2001
13 years 6 months ago
2001