2980 search results - page 283 / 596 » Computational Geometry |
353
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
We present a real-time algorithm for rendering translucent objects of arbitrary shapes. We approximate the scattering of light inside the objects using the diffusion equation, whi...
167
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
163
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe a new implementation of the well-known incremental algorithm for constructing Delaunay triangulations in any dimension. Our implementation follows the exact computing ...
163
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
186
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...