Sciweavers

14 search results - page 1 / 3
» Exact Minkowski Products of N Complex Disks
Sort
View
RC
2002
103views more  RC 2002»
13 years 4 months ago
Exact Minkowski Products of N Complex Disks
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
Rida T. Farouki, Helmut Pottmann
CCCG
2007
13 years 6 months ago
A Disk-Covering Problem with Application in Optical Interferometry
Given a disk O in the plane called the objective, we want to find n small disks P1, . . . , Pn called the pupils such that n i,j=1 Pi Pj ⊇ O, where denotes the Minkowski diffe...
Trung Nguyen, Jean-Daniel Boissonnat, Fréd&...
COMPGEOM
2011
ACM
12 years 8 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
LATIN
2010
Springer
13 years 7 months ago
Lightweight Data Indexing and Compression in External Memory
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are light...
Paolo Ferragina, Travis Gagie, Giovanni Manzini
ICALP
2001
Springer
13 years 9 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi