Greedy Cuts

An advancing front terrain triangulation algorithm

Claudio Silva, Joseph S.B. Mitchell

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

Abstract

We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithm uses a simple triangulation-growth procedure. We improve on our earlier advancing-front technique, which was not able to backtrack in its triangulation decisions, resulting in triangulations that may have low quality. The new algorithm we propose overcomes this shortcoming by maintaining two "fronts", a real front and a virtual front, that bound between them a region of the terrain that has only a tentative triangulation. By allowing simple local operations (edge collapses and edge flips) in the tentative triangulation, we are able to avoid many of the artifacts of the earlier advancing-front technique, while not significantly affecting memory usage. GcTin, our terrain triangulation tool, is publicly available for research purposes. The original version of GcTin has been in use at several commercial and non-commercial sites since 1995. The new algorithms described here are integrated in the latest release and result in substantially improved triangulations.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998
PublisherAssociation for Computing Machinery
Pages137-144
Number of pages8
VolumePart F129244
ISBN (Electronic)1581131151
DOIs
StatePublished - Nov 1 1998
Event6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998 - Washington, United States
Duration: Nov 2 1998Nov 7 1998

Other

Other6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998
CountryUnited States
CityWashington
Period11/2/9811/7/98

Fingerprint

triangulation
Triangulation
Simplification
Decimation
Flip
artifact
Refinement
Data storage equipment

ASJC Scopus subject areas

  • Earth-Surface Processes
  • Computer Science Applications
  • Modeling and Simulation
  • Computer Graphics and Computer-Aided Design
  • Information Systems

Cite this

Silva, C., & Mitchell, J. S. B. (1998). Greedy Cuts: An advancing front terrain triangulation algorithm. In Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998 (Vol. Part F129244, pp. 137-144). Association for Computing Machinery. https://doi.org/10.1145/288692.288717

Greedy Cuts : An advancing front terrain triangulation algorithm. / Silva, Claudio; Mitchell, Joseph S.B.

Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998. Vol. Part F129244 Association for Computing Machinery, 1998. p. 137-144.

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

Silva, C & Mitchell, JSB 1998, Greedy Cuts: An advancing front terrain triangulation algorithm. in Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998. vol. Part F129244, Association for Computing Machinery, pp. 137-144, 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998, Washington, United States, 11/2/98. https://doi.org/10.1145/288692.288717
Silva C, Mitchell JSB. Greedy Cuts: An advancing front terrain triangulation algorithm. In Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998. Vol. Part F129244. Association for Computing Machinery. 1998. p. 137-144 https://doi.org/10.1145/288692.288717
Silva, Claudio ; Mitchell, Joseph S.B. / Greedy Cuts : An advancing front terrain triangulation algorithm. Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998. Vol. Part F129244 Association for Computing Machinery, 1998. pp. 137-144
@inproceedings{87a4219101aa4e0dac48dc2fa522b760,
title = "Greedy Cuts: An advancing front terrain triangulation algorithm",
abstract = "We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithm uses a simple triangulation-growth procedure. We improve on our earlier advancing-front technique, which was not able to backtrack in its triangulation decisions, resulting in triangulations that may have low quality. The new algorithm we propose overcomes this shortcoming by maintaining two {"}fronts{"}, a real front and a virtual front, that bound between them a region of the terrain that has only a tentative triangulation. By allowing simple local operations (edge collapses and edge flips) in the tentative triangulation, we are able to avoid many of the artifacts of the earlier advancing-front technique, while not significantly affecting memory usage. GcTin, our terrain triangulation tool, is publicly available for research purposes. The original version of GcTin has been in use at several commercial and non-commercial sites since 1995. The new algorithms described here are integrated in the latest release and result in substantially improved triangulations.",
author = "Claudio Silva and Mitchell, {Joseph S.B.}",
year = "1998",
month = "11",
day = "1",
doi = "10.1145/288692.288717",
language = "English (US)",
volume = "Part F129244",
pages = "137--144",
booktitle = "Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Greedy Cuts

T2 - An advancing front terrain triangulation algorithm

AU - Silva, Claudio

AU - Mitchell, Joseph S.B.

PY - 1998/11/1

Y1 - 1998/11/1

N2 - We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithm uses a simple triangulation-growth procedure. We improve on our earlier advancing-front technique, which was not able to backtrack in its triangulation decisions, resulting in triangulations that may have low quality. The new algorithm we propose overcomes this shortcoming by maintaining two "fronts", a real front and a virtual front, that bound between them a region of the terrain that has only a tentative triangulation. By allowing simple local operations (edge collapses and edge flips) in the tentative triangulation, we are able to avoid many of the artifacts of the earlier advancing-front technique, while not significantly affecting memory usage. GcTin, our terrain triangulation tool, is publicly available for research purposes. The original version of GcTin has been in use at several commercial and non-commercial sites since 1995. The new algorithms described here are integrated in the latest release and result in substantially improved triangulations.

AB - We apply an advancing front technique to the problem of simplification of dense digitized terrain models. While most simplification algorithms have been based on either incremental refinement or decimation techniques, our Greedy-Cuts algorithm uses a simple triangulation-growth procedure. We improve on our earlier advancing-front technique, which was not able to backtrack in its triangulation decisions, resulting in triangulations that may have low quality. The new algorithm we propose overcomes this shortcoming by maintaining two "fronts", a real front and a virtual front, that bound between them a region of the terrain that has only a tentative triangulation. By allowing simple local operations (edge collapses and edge flips) in the tentative triangulation, we are able to avoid many of the artifacts of the earlier advancing-front technique, while not significantly affecting memory usage. GcTin, our terrain triangulation tool, is publicly available for research purposes. The original version of GcTin has been in use at several commercial and non-commercial sites since 1995. The new algorithms described here are integrated in the latest release and result in substantially improved triangulations.

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

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

U2 - 10.1145/288692.288717

DO - 10.1145/288692.288717

M3 - Conference contribution

VL - Part F129244

SP - 137

EP - 144

BT - Proceedings of the 6th ACM International Symposium on Advances in Geographic Information Systems, GIS 1998

PB - Association for Computing Machinery

ER -