Sciweavers

739 search results - page 78 / 148
» Sorting Algorithms
Sort
View
VMV
2004
185views Visualization» more  VMV 2004»
13 years 9 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
RT
1999
Springer
13 years 12 months ago
Computing Visibility for Triangulated Panoramas
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
Chi-Wing Fu, Tien-Tsin Wong, Pheng-Ann Heng
DSD
2004
IEEE
97views Hardware» more  DSD 2004»
13 years 11 months ago
Scene Management Models and Overlap Tests for Tile-Based Rendering
Tile-based rendering (also called chunk rendering or bucket rendering) is a promising technique for low-power, 3D graphics platforms. This technique decomposes a scene into smalle...
Iosif Antochi, Ben H. H. Juurlink, Stamatis Vassil...
DEXA
2003
Springer
91views Database» more  DEXA 2003»
14 years 27 days ago
NLC: A Measure Based on Projections
In this paper, we propose a new feature selection criterion. It is based on the projections of data set elements onto each attribute. The main advantages are its speed and simplici...
Roberto Ruiz, José Cristóbal Riquelm...
ESOA
2006
13 years 11 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...