Delaunay triangulation in three dimensions
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Computer Graphics and Applications
- Vol. 15 (5) , 62-69
- https://doi.org/10.1109/38.403829
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Sequencing-by-hybridization revisited: the analog-spectrum proposalIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- Delaunay triangulation using a uniform gridIEEE Computer Graphics and Applications, 1993
- Delaunay triangulations in three dimensions with finite precision arithmeticComputer Aided Geometric Design, 1992
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Higher-dimensional Voronoi diagrams in linear expected timePublished by Association for Computing Machinery (ACM) ,1989
- Algorithms in Combinatorial GeometryPublished by Springer Nature ,1987
- A new algorithm for three-dimensional voronoi tessellationJournal of Computational Physics, 1983
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981