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
CCCG
2001
13 years 6 months ago
2001
We propose a hull operator, the reflex-free hull, that allows us to define a 3D analogue to bays in polygons. The reflex-free hull allows a rich set of topological types, yet for ...
CCCG
2006
13 years 6 months ago
2006
We consider the problem of removing c points from a set S of n points so that the resulting point set has the smallest possible convex hull. Our main result is an O n 4c 2c (3c)c +...
CCCG
2006
13 years 6 months ago
2006
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
CCCG
2006
13 years 6 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...
CCCG
2006
13 years 6 months ago
2006