Sciweavers

51 search results - page 10 / 11
» Density-based clustering of polygons
Sort
View
RT
1998
Springer
13 years 10 months ago
Automatic Calculation of Soft Shadow Textures for Fast, High-Quality Radiosity
We propose a new method for greatly accelerating the computation of complex, detailed shadows in a radiosity solution. Radiosity is computed using a "standard" hierarchi...
Cyril Soler, François X. Sillion
DAWAK
2000
Springer
13 years 10 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton
KDD
1997
ACM
146views Data Mining» more  KDD 1997»
13 years 10 months ago
Density-Connected Sets and their Application for Trend Detection in Spatial Databases
1 Several clustering algorithms have been proposed for class identification in spatial databases such as earth observation databases. The effectivity of the well-known algorithms ...
Martin Ester, Hans-Peter Kriegel, Jörg Sander...
CIVR
2007
Springer
180views Image Analysis» more  CIVR 2007»
13 years 12 months ago
Probabilistic matching and resemblance evaluation of shapes in trademark images
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
Helmut Alt, Ludmila Scharf, Sven Scholz
SIGGRAPH
1997
ACM
13 years 10 months ago
Interactive update of global illumination using a line-space hierarchy
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
George Drettakis, François X. Sillion