Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CCCG
2008
10 years 4 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
10 years 4 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
10 years 4 months ago
Minimum blocking sets of circles for a set of lines in the plane
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...
Natasa Jovanovic, Jan H. M. Korst, Augustus J. E. ...
CCCG
2008
10 years 4 months ago
Linear-Size Meshes
Don Sheehy, Gary L. Miller, Todd Phillips
CCCG
2008
10 years 4 months ago
Exact Pareto-Optimal Coordination of Two Translating Polygonal Robots on a Cyclic Roadmap
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...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
CCCG
2008
10 years 4 months ago
A Class of Convex Polyhedra with Few Edge Unfoldings
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
Alex Benton, Joseph O'Rourke
CCCG
2008
10 years 4 months ago
Application of computational geometry to network p-center location problems
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...
Qiaosheng Shi, Binay K. Bhattacharya
CCCG
2008
10 years 4 months ago
Recognition of Largest Empty Orthoconvex Polygon in a Point Set
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...
Subhas C. Nandy, Krishnendu Mukhopadhyaya, Bhargab...
CCCG
2008
10 years 4 months ago
Smallest enclosing circle centered on a query line segment
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...
Prosenjit Bose, Stefan Langerman, Sasanka Roy
books