CCCG
2010
13 years 11 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
CCCG
2010
13 years 11 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
CCCG
2010
13 years 11 months ago
2010
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
CCCG
2010
13 years 11 months ago
2010
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
CCCG
2010
13 years 11 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
CCCG
2010
13 years 11 months ago
2010
Let
CCCG
2010
13 years 11 months ago
2010
For a given point set S (in general position), two pointed pseudo-triangulations are compatible if their union is plane. We show that for any set S there exist two maximally disjo...
CCCG
2010
13 years 11 months ago
2010
We introduce k-star-shaped polygons, polygons for which there exists at least one point x such that for any point y of the polygon, segment xy crosses the polygon's boundary ...
CCCG
2010
13 years 11 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
CCCG
2010
13 years 11 months ago
2010
In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...