Sciweavers

1274 search results - page 100 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
COMPGEOM
1996
ACM
15 years 2 months ago
Smallest Enclosing Cylinders
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...
Elmar Schömer, Jürgen Sellen, Marek Teic...
COMPGEOM
2006
ACM
15 years 1 months ago
Conflict-free colorings of shallow discs
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
Noga Alon, Shakhar Smorodinsky
COMPGEOM
1995
ACM
15 years 1 months ago
On Conway's Thrackle Conjecture
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
László Lovász, János P...
COMPGEOM
2005
ACM
15 years 3 days ago
Fast construction of nets in low dimensional metrics, and their applications
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
Sariel Har-Peled, Manor Mendel
CGA
2007
14 years 10 months ago
Optical Splitting Trees for High-Precision Monocular Imaging
The authors address the problem of designing and constructing efficient cameras that can simultaneously capture multiple pixel-aligned images for computational photography applic...
Morgan McGuire, Wojciech Matusik, Hanspeter Pfiste...