Sciweavers

35 search results - page 4 / 7
» compgeom 2008
Sort
View
COMPGEOM
2008
ACM
13 years 7 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 7 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri
COMPGEOM
2008
ACM
13 years 7 months ago
Predicates for line transversals to lines and line segments in three-dimensional space
When an observer is in a 3D scene, a topological change in the view arises when the line of sight is tangent to four objects. If we consider polyhedral scenes, the relevant lines ...
Olivier Devillers, Marc Glisse, Sylvain Lazard
COMPGEOM
2008
ACM
13 years 7 months ago
Arrangements of geodesic arcs on the sphere
This movie illustrates exact construction and maintenance of arrangements induced by arcs of great circles embedded on the sphere, also known as geodesic arcs, and exact computati...
Efi Fogel, Ophir Setter, Dan Halperin
COMPGEOM
2008
ACM
13 years 7 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