346 search results - page 34 / 70 » On the sizes of Delaunay meshes |
ASPDAC
2011
ACM
12 years 11 months ago
2011
ACM
This paper studies realization and performance comparison of the sequential and weak consistency models in the network-on-chip (NoC) based distributed shared memory (DSM) multi-cor...
SODA
1994
ACM
13 years 9 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
EUROPAR
2001
Springer
14 years 2 days ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
SIBGRAPI
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract. This paper describes an algorithm for generating unstructured triangulations for arbitrarily shaped twodimensional regions. The algorithm works for regions without cracks...
VISUALIZATION
2000
IEEE
13 years 11 months ago
2000
IEEE
The techniques for reducing the size of a volume dataset by preserving both the geometrical/topological shape and the information encoded in an attached scalar field are attractin...