References
- Anderson, E. S., J. A. Thompson, and R. E. Austin. 2005. “LIDAR Density and Linear Interpolator Effects on Elevation Estimates.” International Journal of Remote Sensing 26 (18): 3889–3900. doi:10.1080/01431160500181671.
- ASPRS. 2003. “ASPRS LIDAR Data Exchange Format Standard Version 1.0.” The American Society for Photogrammetry and Remote Sensing. Accessed April 30, 2014. http://www.asprs.org/a/society/committees/standards
- AWS. 2014. “Amazon Web Services, Inc.” Accessed April 30. http//aws.amazon.com/ec2/
- Barr, J. 2006. “Amazon EC2 Beta.” Amazon Web Services Blog. Accessed April 30, 2014. http://aws.typepad.com/aws/2006/08/amazon_ec2_beta.html
- De Berg, M., M. Van Kreveld, M. Overmars, and O. C. Schwarzkopf. 2000. Computational Geometry. Secaucus, NJ: Springer.
- Dwyer, R. A. 1987. “A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations.” Algorithmica 2 (1–4): 137–151. doi:10.1007/BF01840356.
- Isenburg, M., Y. Liu, J. Shewchuk, and J. Snoeyink. 2006. “Streaming Computation of Delaunay Triangulations.” ACM Transactions on Graphics (TOG) 25: 1049–1056. doi:10.1145/1141911.1141992.
- Kohout, J., I. Kolingerová, and J. Žára. 2005. “Parallel Delaunay Triangulation in E2 and E3 for Computers with Shared Memory.” Parallel Computing 31 (5): 491–522. doi:10.1016/j.parco.2005.02.010.
- Krishnan, S., C. Baru, and C. Crosby. 2010. “Evaluation of Mapreduce for Gridding LIDAR Data.” In 2010 IEEE Second International Conference on Cloud Computing Technology and Science (CloudCom), 33–40. Indianapolis, IN: IEEE.
- Lawson, C. L. 1977. “Software for C1 Surface Interpolation.” In Mathematical Software III, edited by J. R. Rice, 161–194. Pasadena, CA: Jet Propulsion Laboratory, California Institute of Technology.
- Lo, S. H. 2012. “Parallel Delaunay Triangulation – Application to Two Dimensions.” Finite Elements in Analysis and Design 62: 37–48. doi:10.1016/j.finel.2012.07.003.
- Oryspayev, D., R. Sugumaran, J. DeGroote, and P. Gray. 2012. “LiDAR Data Reduction Using Vertex Decimation and Processing with GPGPU and Multicore CPU Technology.” Computers and Geosciences 43: 118–125. doi:10.1016/j.cageo.2011.09.013.
- Peucker, T. K., R. J. Fowler, J. J. Little, and D. M. Mark. 1978. “The Triangulated Irregular Network.” In Proceedings of the Digital Terrain Models Symposium, 516–532. St. Louis, MO: American Society of Photogrammetry.
- Sloan, S. W. 1987. “A Fast Algorithm for Constructing Delaunay Triangulations in the Plane.” Advances in Engineering Software (1978) 9 (1): 34–55. doi:10.1016/0141-1195(87)90043-X.
- Watson, D. F. 1981. “Computing the N-Dimensional Delaunay Tessellation with Application to Voronoi Polytopes.” The Computer Journal 24 (2): 167–172. doi:10.1093/comjnl/24.2.167.
- Wu, H., X. Guan, and J. Gong. 2011. “Parastream: A Parallel Streaming Delaunay Triangulation Algorithm for LiDAR Points on Multicore Architectures.” Computers and Geosciences 37 (9): 1355–1363. doi:10.1016/j.cageo.2011.01.008.
- Yang, C., and Q. Huang. 2013. Spatial Cloud Computing: A Practical Approach. Boca Raton, FL: CRC Press.