References
- Antonopoulos, C.D., et al., 2009a. A multigrain Delaunay mesh generation method for multicore smt-based architectures. Journal Parallel Distrib Computation, 69, 589–600. doi:10.1016/j.jpdc.2009.03.009
- Antonopoulos, C.D., et al., 2009b. Algorithm, software, and hardware optimizations for Delaunay mesh generation on simultaneous multithreaded architectures. Journal Parallel Distrib Computation, 69, 601–612. doi:10.1016/j.jpdc.2009.03.005
- Blelloch, G.E., et al., 1999. Design and implementation of a practical parallel Delaunay algorithm. Algorithmica, 24, 243–269. doi:10.1007/PL00008262
- Chen, M.B., Chuang, T.R., and Wu, J.J., 2006. Parallel divide-and-conquer scheme for 2D Delaunay triangulation. Concurrency Computat.: Practical Exper, 18, 1595–1612. doi:10.1002/cpe.1007
- Chrisochoides, N. and Nave, D., 2003. Parallel Delaunay mesh generation kernel. International Journal for Numerical Methods in Engineering, 58, 161–176. doi:10.1002/(ISSN)1097-0207
- Chrisochoides, N. and Sukup, F., 1996. Task parallel implementation of the Bowyer-Watson algorithm. In: Proceedings of Fifth International Conference on Numerical Grid Generation in Computational Fluid Dynamics and Related Fields, Mississippi: Mississippi State University, 773–782.
- Cignoni, P., et al., 1993. Parallel 3D Delaunay triangulation. Computer Graphics Forum, 12, 129–142. doi:10.1111/cgf.1993.12.issue-3
- Fischer, I. and Gotsman, C., 2006. Fast approximation of high-order voronoi diagrams and distance transforms on the GPU. Journal Graphics Tools, 11 (4), 39–60. doi:10.1080/2151237X.2006.10129229
- Kohout, J., Kolingerová, I., and Zára, J., 2005. Parallel Delaunay triangulation in E2 and E3 for computers with shared memory. Parallel Computing, 31, 491–522. doi:10.1016/j.parco.2005.02.010
- Lee, S., Park, C.I., and Park, C.M., 1997. An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers. In: Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC ’97), Washington, DC: IEEE Computer Society, 131–138.
- Lo, S.H., 2012. Parallel Delaunay triangulation – Application to two dimensions. Finite Elements in Analysis and Design, 62, 37–45. doi:10.1016/j.finel.2012.07.003
- Navarro, C., Hitschfeld, N., and Scheihing, E., 2011. A parallel GPU-based algorithm for Delaunay edge-flips. Abstracts from 27th European Workshop on Computational Geometry, 2011, 75–78.
- Qi, M., Cao, T.T., and Tan, T.S., 2013. Computing 2D constrained Delaunay triangulation using the GPU. IEEE Transactions on Visualization and Computer Graphics, 19 (5), 736–748. doi:10.1109/TVCG.2012.307
- Rong, G., Tan, T.S., and Cao, T.T., and Stephanus, 2008. Computing two-dimensional Delaunay triangulation using graphics hardware. In: Proceedings of the 2008 symposium on Interactive 3D graphics and games, I3D ’08, New York, NY: ACM, 89–97.
- Santaló, L.A., 1976. Integral geometry and geometric probability. Reading, MA: Addison-Wesley.
- Shewchuk, J.R., 1996. Triangle: engineering a 2D quality mesh generator and delaunay triangulator. In: Applied Computational Geometry: Towards Geometric Engineering, Lecture Notes in Computer Science, Berlin: Springer-Verlag, 1148, 203–222.
- Wu, H., Guan, X., and Gong, J., 2011. ParaStream: a parallel Delaunay triangulation algorithm for LiDAR points on multicorearchitectures. Computers and Geosciencies, 37, 1355–1363. doi:10.1016/j.cageo.2011.01.008
- Wu, W., et al., 2014. Novel parallel algorithm for constructing Delaunay triangulation based on a twofold-divide-and-conquer scheme. GIScience & Remote Sensing, 51 (5), 537–554. doi:10.1080/15481603.2014.946666