HORIZON COMPUTATION ON A HIERARCHICAL TRIANGULATED TERRAIN MODEL

被引：16

作者：

DEFLORIANI, L

MAGILLO, P

机构：

[1] Department of Information and Computer Science, University of Genoa, Genoa, 16132, Viale Benedetto XV

来源：

VISUAL COMPUTER | 1995年 / 11卷 / 03期

关键词：

DIGITAL TERRAIN MODELS; HIERARCHICAL MODELS; VISIBILITY; DYNAMIC ALGORITHMS; RANDOMIZED ALGORITHMS;

D O I：

10.1007/BF01898599

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Hierarchical terrain models describe a topographic surface at different levels of detail, thus providing a multiresolution surface representation as well as a data compression mechanism. We consider the horizon computation problem on a hierarchical polyhedral terrain (in particular, on a hierarchical triangulated irregular network), which involves extracting the horizon of a viewpoint at a given resolution and updating it as the resolution increases. We present an overview of horizon computation algorithms on a nonhierarchical polyhedral terrain. We extend such algorithms to the hierarchical case by describing a method which extracts the terrain edges at a given resolution, and proposing a randomized algorithm for dynamically updating a horizon under insertions and deletions of terrain edges

引用

页码：134 / 149

页数：16

共 19 条

[1]

Atallah M., Dynamic computational geometry, Proceedings of the 24th Symposium on Foundations of Computer Science, pp. 92-99, (1983)

[2]

Barrera R., Vaquez A.M., A hierarchical method for representing relief, Proceedings of the Pecora IX Symposium on Spatial Information Technologies for Remote Sensing Today and Tomorrow, pp. 87-92, (1984)

[3]

[4]

Boissonnat J.D., Devillers O., Schott R., Tailland M., Yvinec M., Application of random sampling to on-line algorithms in computational geometry, Discrete Computational Geom, 8, pp. 51-71, (1992)

[5]

Cazzanti M., De Floriani L., Nagy G., Puppo E., Visibility computation on a triangulated terrain, Progress in image analysis and processing II, pp. 721-728, (1991)

[6]

Clarkson K.L., Shor P.W., Application of random sampling in computer geometry, Discrete Computational Geom, 4, pp. 387-421, (1989)

[7]

Cole R., Sharir M., Visibility problems for polyhedral terrains, J Symbolic Computation, 17, pp. 11-30, (1989)

[8]

De Flonani L., Magillo P., Visibility algorithms on triangulated terrain models, Int. J. Geograph Inform Syst, 8, pp. 13-41, (1994)

[9]

De Floriani L., Magillo P., A randomized dynamic algorithm for computing the upper envelope of segments, Technical report PDISI-94-7, (1994)

[10]

De Floriani L., Falcidieno B., Pienovi C., A hierarchical data structure for surface approximation, Comput Graphics, 8, pp. 475-484, (1984)

← 1 2 →