Testing Shortcuts to Maintain Simplicity in Subdivision Simplification.

摘要: Cartographers collect more data than they need, and so must simplify coastlines, boundaries, other linear features to display a map at given scale. Many simplification methods, however, can introduce intersections that were not originally present, corrupting the features. Kulik suggests simple shortcut operation for polygonal lines: remove point pi connect its former neighbors pi−1 pi+1 directly, but only if triangle pi−1pipi+1 is empty of points. We show geodesic triangulations support operations tests in O log n time connected subdivisions size n. This be integrated into methods cartographic preferences also avoid self-intersection.