Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Implant sprays: compression of progressive tetrahedral mesh connectivity
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core build of a topological data structure from polygon soup
Proceedings of the sixth ACM symposium on Solid modeling and applications
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Progressive lossless compression of arbitrary simplicial complexes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry
Journal of Functional Programming
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse parallel Delaunay mesh refinement
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Parallel geometric algorithms for multi-core computers
Proceedings of the twenty-fifth annual symposium on Computational geometry
Structure-driven optimizations for amorphous data-parallel programs
Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Parallel geometric algorithms for multi-core computers
Computational Geometry: Theory and Applications
Towards a science of parallel programming
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
The tao of parallelism in algorithms
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
High quality real-time image-to-mesh conversion for finite element simulations
Proceedings of the 27th international ACM conference on International conference on supercomputing
High quality real-time Image-to-Mesh conversion for finite element simulations
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version of the Bowyer-Watson incremental insertion, and a thread-safe space-efficient structure for representing the mesh. Using the implementation we are able to generate significantly larger Delaunay meshes than have previously been generated—10 billion tetrahedra on a 64 processor SMP using 200GB of RAM.The implementation makes use of a locality based relabeling of the vertices that serves three purposes—it is used as part of the space efficient representation, it improves the memory locality, and it reduces the overhead necessary for locks. The implementation also makes use of a caching technique to avoid excessive decoding of vertex information, a technique for backing out of insertions that collide, and a shared work queue for maintaining points that have yet to be inserted.