Sciweavers

51 search results - page 7 / 11
» Density-based clustering of polygons
Sort
View
AFRIGRAPH
2003
ACM
13 years 11 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
VISUALIZATION
1999
IEEE
13 years 11 months ago
Efficient Compression of Non-Manifold Polygonal Meshes
We present a method for compressing non-manifold polygonal meshes, i.e., polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygon...
André Guéziec, Frank Bossen, Gabriel...
JGS
2006
113views more  JGS 2006»
13 years 7 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
TKDE
2002
168views more  TKDE 2002»
13 years 7 months ago
CLARANS: A Method for Clustering Objects for Spatial Data Mining
Spatial data mining is the discovery of interesting relationships and characteristics that may exist implicitly in spatial databases. To this end, this paper has three main contrib...
Raymond T. Ng, Jiawei Han
RT
1999
Springer
13 years 11 months ago
Face Cluster Radiosity
Abstract. An algorithm for simulating diffuse interreflection in complex three dimensional scenes is described. It combines techniques from hierarchical radiosity and multiresolut...
Andrew J. Willmott, Paul S. Heckbert, Michael Garl...