Sciweavers

14 search results - page 2 / 3
» Exact Minkowski Products of N Complex Disks
Sort
View
JACM
2000
119views more  JACM 2000»
13 years 5 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
CCCG
2008
13 years 6 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'...
FSTTCS
2006
Springer
13 years 9 months ago
Computing a Center-Transversal Line
A center-transversal line for two finite point sets in R3 is a line with the property that any closed halfspace that contains it also contains at least one third of each point set...
Pankaj K. Agarwal, Sergio Cabello, Joan Antoni Sel...
COMPGEOM
2006
ACM
13 years 11 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
FAST
2008
13 years 7 months ago
Parity Lost and Parity Regained
RAID storage systems protect data from storage errors, such as data corruption, using a set of one or more integrity techniques, such as checksums. The exact protection offered by...
Andrew Krioukov, Lakshmi N. Bairavasundaram, Garth...