Sciweavers

199 search results - page 13 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
DGCI
1999
Springer
13 years 12 months ago
Directional 3D Thinning Using 8 Subiterations
Thinning of a binary object is an iterative layer by layer erosion to extract an approximation to its skeleton. In order to provide topology preservation, different thinning techn...
Kálmán Palágyi, Attila Kuba
3DIM
2007
IEEE
14 years 2 months ago
Cached k-d tree search for ICP algorithms
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
Andreas Nüchter, Kai Lingemann, Joachim Hertz...
PG
2007
IEEE
14 years 1 months ago
Fogshop: Real-Time Design and Rendering of Inhomogeneous, Single-Scattering Media
We describe a new, analytic approximation to the airlight integral from scattering media whose density is modeled as a sum of Gaussians. The approximation supports real-time rende...
Kun Zhou, Qiming Hou, Minmin Gong, John Snyder, Ba...
CORR
2010
Springer
133views Education» more  CORR 2010»
13 years 7 months ago
Computational efficiency of fractional diffusion using adaptive time step memory
Abstract: Numerical solutions to fractional differential equations can be extremely computationally intensive due to the effect of non-local derivatives in which all previous time ...
Brian P. Sprouse, Christopher L. MacDonald, Gabrie...
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
13 years 9 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson