Sciweavers

Share
COMPGEOM
2007
ACM
9 years 1 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
COMPGEOM
2007
ACM
9 years 3 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
COMPGEOM
2007
ACM
9 years 3 months ago
Computing the exact arrangement of circles on a sphere, with applications in structural biology: video
The Bentley-Ottmann (BO) algorithm, initially designed to report the intersection points of line-segments in the plane, is the prototypical sweep-line algorithm. This video presen...
Frédéric Cazals, Sébastien Lo...
COMPGEOM
2007
ACM
9 years 3 months ago
Towards an implementation of the 3D visibility skeleton
Linqiao Zhang, Hazel Everett, Sylvain Lazard, Sue ...
COMPGEOM
2007
ACM
9 years 3 months ago
A PTAS for k-means clustering based on weak coresets
Dan Feldman, Morteza Monemizadeh, Christian Sohler
COMPGEOM
2007
ACM
9 years 3 months ago
Distributed computation of virtual coordinates
Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devis...
Mirela Ben-Chen, Craig Gotsman, Camille Wormser
COMPGEOM
2007
ACM
9 years 3 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann
COMPGEOM
2007
ACM
9 years 3 months ago
Streaming algorithms for line simplification
We study the following variant of the well-known line-simplification problem: we are getting a possibly infinite sequence of points p0, p1, p2, . . . in the plane defining a polyg...
Mohammad Ali Abam, Mark de Berg, Peter Hachenberge...
books