Sciweavers

COMPGEOM
2008
ACM
13 years 5 months ago
Helly-type theorems for approximate covering
Julien Demouth, Olivier Devillers, Marc Glisse, Xa...
COMPGEOM
2008
ACM
13 years 5 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
COMPGEOM
2008
ACM
13 years 5 months ago
Walking your dog in the woods in polynomial time
The Fr
Erin W. Chambers, Éric Colin de Verdi&egrav...
COMPGEOM
2008
ACM
13 years 5 months ago
A simple and efficient kinetic spanner
We present a kinetic data structure for maintaining a (1+ )-spanner of size O(n/2 ) for a set of n moving points in the plane. Assuming the trajectories of the points can be descr...
Mohammad Ali Abam, Mark de Berg, Joachim Gudmundss...
COMPGEOM
2008
ACM
13 years 5 months ago
Improved upper bounds on the crossing number
Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar...
COMPGEOM
2008
ACM
13 years 5 months ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel
COMPGEOM
2008
ACM
13 years 5 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
COMPGEOM
2008
ACM
13 years 5 months ago
Analyzing rigidity with pebble games
Audrey Lee, Ileana Streinu, Louis Theran
COMPGEOM
2008
ACM
13 years 5 months ago
Optimizing active ranges for consistent dynamic map labeling
Ken Been, Martin Nöllenburg, Sheung-Hung Poon...