COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
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...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
The Fr
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
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...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
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 ...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
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 ...
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM