We attempt to show that a tessellated spatial model has definite advantages for cartographic applications, and facilitates a kinetic structure for map updating and simulation. We develop the moving-point Delaunay/Voronoi model that manages collision detection snapping and intersection at the data input stage by maintaining a topology based on a complete tessellation. We show that the Constrained Delaunay triangulation allows the simulation of edges, and not just points, with only minor changes to the moving-point model. We then develop an improved kinetic Line-segment Voronoi diagram, which is a better-specified model of the spatial relationships for compound map objects than is the Constrained Triangulation. However, until now it has been more difficult to implement. We believe that this method is now viable for 2D cartography, and in many cases it should replace the Constrained approach. Whichever method is used, the concept of using the moving point as a pen, with the ability to delete and add line segments as desired in the construction and updating process, appears to be a valuable development. © 2006 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Dakowicz, M., & Gold, C. (2006). Structuring kinetic maps. In Progress in Spatial Data Handling - 12th International Symposium on Spatial Data Handling, SDH 2006 (pp. 477–493). https://doi.org/10.1007/3-540-35589-8_31
Mendeley helps you to discover research relevant for your work.