TRIANGULATIONS FOR RUBBER-SHEETING
暂无分享,去创建一个
This paper focuses on the application of triangulation and rubber-sheeting techniques to the problem of merging two digitized map files. The Census Bureau is currently developing a map merging procedure called conflation. Reproducibility, quality control, and a desire for mathematical consistency in conflation lead to a need for well-defined procedures. The Delaunay triangulation is well-defined and in some sense the 'best' triangulation on a finite set of points. It leads naturally into an efficient rubber^sheeting algorithm. The discussion starts with triangulations and rubber-sheeting in general and well-defined triangulations. This leads to the Delaunay triangulation, an algorithm for that triangulation and a specific rubber-sheeting technique. Finally, some problems that require further research are mentioned in an appendix.
[1] D. T. Lee,et al. Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.
[2] Alan Saalfeld,et al. A Fast Rubber-Sheeting Transformation Using Simplicial Coordinates , 1985 .
[3] J Corbett,et al. Topological principles in cartography , 1979 .
[4] Solomon Lefschetz,et al. Applications of algebraic topology , 1975 .
[5] M. White,et al. Piecewise Linear Rubber-Sheet Map Transformation , 1985 .