A fast digital terrain simplification algorithm with a partitioning method

Yoon Sig Kang, Taixup Lee, Sung-Bong Yang, Woo Chan Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in (Anjyo et al., 1992; Floriani et al., 1984; 1985). Our algorithm partitions terrain height data into rectangular blocks with the same size and simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles within each current block for adding a point into the triangulation. Therefore, our algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that the partitioning method runs from 4 to more than 20 times faster and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in the simplified terrain.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages613-618
Number of pages6
ISBN (Electronic)0769505902, 9780769505909
DOIs
Publication statusPublished - 2000 Jan 1
Event4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 - Beijing, China
Duration: 2000 May 142000 May 17

Publication series

NameProceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
Volume2

Other

Other4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000
CountryChina
CityBeijing
Period00/5/1400/5/17

Fingerprint

Triangulation
Experiments

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Kang, Y. S., Lee, T., Yang, S-B., & Park, W. C. (2000). A fast digital terrain simplification algorithm with a partitioning method. In Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 (pp. 613-618). [843506] (Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000; Vol. 2). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPC.2000.843506
Kang, Yoon Sig ; Lee, Taixup ; Yang, Sung-Bong ; Park, Woo Chan. / A fast digital terrain simplification algorithm with a partitioning method. Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000. Institute of Electrical and Electronics Engineers Inc., 2000. pp. 613-618 (Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000).
@inproceedings{35339b8033ee42f480f57ce286cdf4ab,
title = "A fast digital terrain simplification algorithm with a partitioning method",
abstract = "We introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in (Anjyo et al., 1992; Floriani et al., 1984; 1985). Our algorithm partitions terrain height data into rectangular blocks with the same size and simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles within each current block for adding a point into the triangulation. Therefore, our algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that the partitioning method runs from 4 to more than 20 times faster and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in the simplified terrain.",
author = "Kang, {Yoon Sig} and Taixup Lee and Sung-Bong Yang and Park, {Woo Chan}",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/HPC.2000.843506",
language = "English",
series = "Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "613--618",
booktitle = "Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000",
address = "United States",

}

Kang, YS, Lee, T, Yang, S-B & Park, WC 2000, A fast digital terrain simplification algorithm with a partitioning method. in Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000., 843506, Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000, vol. 2, Institute of Electrical and Electronics Engineers Inc., pp. 613-618, 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000, Beijing, China, 00/5/14. https://doi.org/10.1109/HPC.2000.843506

A fast digital terrain simplification algorithm with a partitioning method. / Kang, Yoon Sig; Lee, Taixup; Yang, Sung-Bong; Park, Woo Chan.

Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000. Institute of Electrical and Electronics Engineers Inc., 2000. p. 613-618 843506 (Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000; Vol. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A fast digital terrain simplification algorithm with a partitioning method

AU - Kang, Yoon Sig

AU - Lee, Taixup

AU - Yang, Sung-Bong

AU - Park, Woo Chan

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in (Anjyo et al., 1992; Floriani et al., 1984; 1985). Our algorithm partitions terrain height data into rectangular blocks with the same size and simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles within each current block for adding a point into the triangulation. Therefore, our algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that the partitioning method runs from 4 to more than 20 times faster and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in the simplified terrain.

AB - We introduce a fast simplification algorithm for terrain height fields to produce a triangulated irregular network, based on the greedy insertion algorithm in (Anjyo et al., 1992; Floriani et al., 1984; 1985). Our algorithm partitions terrain height data into rectangular blocks with the same size and simplifies blocks one by one with the greedy insertion algorithm. Our algorithm references only to the points and the triangles within each current block for adding a point into the triangulation. Therefore, our algorithm runs faster than the greedy insertion algorithm, which references all input points and triangles in the terrain. Our experiment shows that the partitioning method runs from 4 to more than 20 times faster and it approximates test height fields as accurately as the greedy insertion algorithms. Most greedy insertion algorithms suffer from elongated triangles that usually appear near the boundaries. However, we insert the four corner points into each block to produce the base triangulation of the block before the point addition step begins so that elongated triangles could not appear in the simplified terrain.

UR - http://www.scopus.com/inward/record.url?scp=84960401375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84960401375&partnerID=8YFLogxK

U2 - 10.1109/HPC.2000.843506

DO - 10.1109/HPC.2000.843506

M3 - Conference contribution

AN - SCOPUS:84960401375

T3 - Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

SP - 613

EP - 618

BT - Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Kang YS, Lee T, Yang S-B, Park WC. A fast digital terrain simplification algorithm with a partitioning method. In Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000. Institute of Electrical and Electronics Engineers Inc. 2000. p. 613-618. 843506. (Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000). https://doi.org/10.1109/HPC.2000.843506