Streaming computation of Delaunay triangulations
- 1 July 2006
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 25 (3), 1049-1056
- https://doi.org/10.1145/1141911.1141992
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Cache-oblivious mesh layoutsACM Transactions on Graphics, 2005
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONSInternational Journal of Computational Geometry & Applications, 2005
- Out-of-core compression for gigantic polygon meshesACM Transactions on Graphics, 2003
- External memory algorithms and data structuresACM Computing Surveys, 2001
- Design and Implementation of a Practical Parallel Delaunay AlgorithmAlgorithmica, 1999
- DeWall: A fast divide and conquer Delaunay triangulation algorithm in EdComputer-Aided Design, 1998
- A Randomized Algorithm for Closest-Point QueriesSIAM Journal on Computing, 1988
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two-dimensional automatic mesh generation for structural analysisInternational Journal for Numerical Methods in Engineering, 1970