Automatic generation of triangular irregular networks using Greedy cuts

Claudio T. Silva, Joseph S B Mitchell, Arie E. Kaufman

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

Abstract

We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimum-link paths in polygons. Our algorithm works by taking greedy cuts ('bites') out of a simple closed polygon that bounds the yet-to-be triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array.

Original languageEnglish (US)
Title of host publicationProceedings of the IEEE Visualization Conference
EditorsGregory M. Nielson, Deborah Silver
PublisherIEEE
Pages201-208
Number of pages8
StatePublished - 1995
EventProceedings of the 1995 6th Annual IEEE Conference on Visualization - Atlanta, GA, USA
Duration: Oct 29 1995 → …

Other

OtherProceedings of the 1995 6th Annual IEEE Conference on Visualization
CityAtlanta, GA, USA
Period10/29/95 → …

Fingerprint

Data storage equipment
Costs

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

Silva, C. T., Mitchell, J. S. B., & Kaufman, A. E. (1995). Automatic generation of triangular irregular networks using Greedy cuts. In G. M. Nielson, & D. Silver (Eds.), Proceedings of the IEEE Visualization Conference (pp. 201-208). IEEE.

Automatic generation of triangular irregular networks using Greedy cuts. / Silva, Claudio T.; Mitchell, Joseph S B; Kaufman, Arie E.

Proceedings of the IEEE Visualization Conference. ed. / Gregory M. Nielson; Deborah Silver. IEEE, 1995. p. 201-208.

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

Silva, CT, Mitchell, JSB & Kaufman, AE 1995, Automatic generation of triangular irregular networks using Greedy cuts. in GM Nielson & D Silver (eds), Proceedings of the IEEE Visualization Conference. IEEE, pp. 201-208, Proceedings of the 1995 6th Annual IEEE Conference on Visualization, Atlanta, GA, USA, 10/29/95.
Silva CT, Mitchell JSB, Kaufman AE. Automatic generation of triangular irregular networks using Greedy cuts. In Nielson GM, Silver D, editors, Proceedings of the IEEE Visualization Conference. IEEE. 1995. p. 201-208
Silva, Claudio T. ; Mitchell, Joseph S B ; Kaufman, Arie E. / Automatic generation of triangular irregular networks using Greedy cuts. Proceedings of the IEEE Visualization Conference. editor / Gregory M. Nielson ; Deborah Silver. IEEE, 1995. pp. 201-208
@inproceedings{d9b578ab8cd74402a52f1c914813a7e4,
title = "Automatic generation of triangular irregular networks using Greedy cuts",
abstract = "We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimum-link paths in polygons. Our algorithm works by taking greedy cuts ('bites') out of a simple closed polygon that bounds the yet-to-be triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array.",
author = "Silva, {Claudio T.} and Mitchell, {Joseph S B} and Kaufman, {Arie E.}",
year = "1995",
language = "English (US)",
pages = "201--208",
editor = "Nielson, {Gregory M.} and Deborah Silver",
booktitle = "Proceedings of the IEEE Visualization Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Automatic generation of triangular irregular networks using Greedy cuts

AU - Silva, Claudio T.

AU - Mitchell, Joseph S B

AU - Kaufman, Arie E.

PY - 1995

Y1 - 1995

N2 - We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimum-link paths in polygons. Our algorithm works by taking greedy cuts ('bites') out of a simple closed polygon that bounds the yet-to-be triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array.

AB - We propose a new approach to the automatic generation of triangular irregular networks from dense terrain models. We have developed and implemented an algorithm based on the greedy principle used to compute minimum-link paths in polygons. Our algorithm works by taking greedy cuts ('bites') out of a simple closed polygon that bounds the yet-to-be triangulated region. The algorithm starts with a large polygon, bounding the whole extent of the terrain to be triangulated, and works its way inward, performing at each step one of three basic operations: ear cutting, greedy biting, and edge splitting. We give experimental evidence that our method is competitive with current algorithms and has the potential to be faster and to generate many fewer triangles. Also, it is able to keep the structural terrain fidelity at almost no extra cost in running time and it requires very little memory beyond that for the input height array.

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

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

M3 - Conference contribution

SP - 201

EP - 208

BT - Proceedings of the IEEE Visualization Conference

A2 - Nielson, Gregory M.

A2 - Silver, Deborah

PB - IEEE

ER -