“…Currently, the commonly used algorithms for data simplification of vector line elements include the Douglas-Peucker algorithm [3], circle simplification [4], polygon fitting algorithm [5], McMaster-Jenks algorithm [6], [7], Delaunay triangulation algorithm [8], [9], GSC compression algorithm and de-GSC decomposition algorithm [10]- [12]. Wang [13] focused on the SPIHT compression algorithm and real-time visualization of large-scale scenes.…”