CCCG
2008
13 years 6 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
CCCG
2008
13 years 6 months ago
2008
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
CCCG
2008
13 years 6 months ago
2008
A circle C is occluded by a set of circles C1, . . . , Cn if every line that intersects C also intersects at least one of the Ci, i = 1, . . . , n. In this paper, we focus on dete...
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
CCCG
2008
13 years 6 months ago
2008
CCCG
2008
13 years 6 months ago
2008
We construct a sequence of convex polyhedra on n vertices with the property that, as n, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the frac
CCCG
2008
13 years 6 months ago
2008
In this paper we showed that a p( 2)-center location problem in general networks can be transformed to the well known Klee's measure problem [5]. This resulted in an improved...
CCCG
2008
13 years 6 months ago
2008
An algorithm for computing the maximum area empty isothetic orthoconvex polygon among a set of n points in a rectangular region, is presented. The worst case time and space comple...
CCCG
2008
13 years 6 months ago
2008
Given a set of n points P = {p1, p2, . . . , pn} in the plane, we show how to preprocess P such that for any query line segment L we can report in O(log n) time the smallest enclo...