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 language | English |
|---|---|
| Title of host publication | 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 |
| Number of pages | 6 |
| ISBN (Electronic) | 0769505902, 9780769505909 |
| DOIs | |
| Publication status | Published - 2000 Jan 1 |
| Event | 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 - Beijing, China Duration: 2000 May 14 → 2000 May 17 |
Publication series
| Name | Proceedings - 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 |
|---|---|
| Volume | 2 |
Other
| Other | 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000 |
|---|---|
| Country | China |
| City | Beijing |
| Period | 00/5/14 → 00/5/17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computational Theory and Mathematics
- Computer Networks and Communications
- Computer Science Applications
Cite this
}
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 proceeding › Conference 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 -