Sciweavers

COMPGEOM
2003
ACM
14 years 4 months ago
Complexity of the delaunay triangulation of points on surfaces the smooth case
Dominique Attali, Jean-Daniel Boissonnat, Andr&eac...
COMPGEOM
2003
ACM
14 years 4 months ago
Cost-driven octree construction schemes: an experimental study
Given a scene consisting of objects, ray shooting queries answer with the first object encountered by a given ray, and are used in ray tracing and radiosity for rendering photo-r...
Boris Aronov, Hervé Brönnimann, Allen ...
COMPGEOM
2003
ACM
14 years 4 months ago
Hausdorff distance under translation for points and balls
Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir,...
COMPGEOM
2003
ACM
14 years 4 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
COMPGEOM
2003
ACM
14 years 4 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...