Sciweavers

47 search results - page 5 / 10
» cccg 2008
Sort
View
CCCG
2008
13 years 11 months ago
Polynomial irreducibility testing through Minkowski summand computation
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...
Deepanjan Kesh, Shashank K. Mehta
CCCG
2008
13 years 11 months ago
Convex Hull of the Union of Convex Objects in the Plane: an Adaptive Analysis
We prove a tight asymptotic bound of ( log(n/)) on the worst case computational complexity of the convex hull of the union of two convex objects of sizes summing to n requiring o...
Jérémy Barbay, Eric Y. Chen
CCCG
2008
13 years 11 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
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...
A. Karim Abu-Affash, Matthew J. Katz
CCCG
2008
13 years 11 months ago
Monochromatic simplices of any volume
We give a very short proof of the following result of Graham from 1980: For any finite coloring of Rd , d 2, and for any > 0, there is a monochromatic (d + 1)-tuple that span...
Adrian Dumitrescu, Minghui Jiang
CCCG
2008
13 years 11 months ago
Maximal Covering by Two Isothetic Unit Squares
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
Priya Ranjan Sinha Mahapatra, Partha P. Goswami, S...