Sciweavers

1387 search results - page 264 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
2010
ACM
14 years 18 days ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
SIGGRAPH
2010
ACM
14 years 11 hour ago
Paneling architectural freeform surfaces
The emergence of large-scale freeform shapes in architecture poses big challenges to the fabrication of such structures. A key problem is the approximation of the design surface b...
Michael Eigensatz, Martin Kilian, Alexander Schift...
LSSC
2001
Springer
13 years 12 months ago
On the Parallelization of the Sparse Grid Approach for Data Mining
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
Jochen Garcke, Michael Griebel
LSSC
2001
Springer
13 years 12 months ago
Parallel Implementation of a Large-Scale 3-D Air Pollution Model
Abstract. Air pollution models can efficiently be used in different environmental studies. The atmosphere is the most dynamic component of the environment, where the pollutants ca...
Tzvetan Ostromsky, Zahari Zlatev
SIGGRAPH
1989
ACM
13 years 11 months ago
Algorithms for solid noise synthesis
A solid noise is a function that defines a random value at each point in space. Solid noises have immediate and powerful applications in surface texturing, stochastic modeling, a...
J. P. Lewis