6393 search results - page 27 / 1279 » Randomized Algorithms on the Mesh |
100
click to vote
GMP
2006
IEEE
15 years 8 months ago
2006
IEEE
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
129
click to vote
COMGEO
2006
ACM
15 years 1 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
176
click to vote
SIGGRAPH
1994
ACM
15 years 6 months ago
1994
ACM
The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determ...
VISUALIZATION
2005
IEEE
15 years 7 months ago
2005
IEEE
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
102
click to vote
ESA
1998
Springer
15 years 6 months ago
1998
Springer
We give two, new upper bounds for oblivious permutation routing on the mesh networks: Let N be the total number of processors in each mesh. One is an O(N0.75 ) algorithm on the tw...