A new architecture for efficient hybrid representation of terrains

Authors:
M. Amor;M. Bóo
Affiliations:
Department of Electronics and Systems, University of A Coruña, Spain;Department of Electronics and Computer Engineering, University of Santiago de Compostela, Spain
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2008

Citing 8
Cited 1

Visibility-ordering meshed polyhedra

ACM Transactions on Graphics (TOG)
Adaptive view dependent tessellation of displacement maps

HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Hardware support for adaptive subdivision surface rendering

Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Computational Geometry in C

Computational Geometry in C
Cell-projection of cyclic meshes

Proceedings of the conference on Visualization '01
Level of Detail for 3D Graphics

Level of Detail for 3D Graphics
Modeling and visualization of complex geometric environments

Geometric modeling
A Meshing Scheme for Efficient Hardware Implementation of Butterfly Subdivision Using Displacement Mapping

IEEE Computer Graphics and Applications

Dynamic hybrid terrain representation based on convexity limits identification

International Journal of Geographical Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interactive visualization of highly detailed terrain models is a challenging problem as the size of the data sets can easily exceed the capabilities of current hardware. Hybrid representation of terrains tries to solve the problem by combining the advantages in terms of reduced size associated with multiple levels-of-detail of digital elevation models with the high quality associated with the triangulated irregular networks. However, as the measurements of both representations have different origins, a direct representation of the hybrid system would result in discontinuities. In this paper, we present an architecture for hybrid representation of terrains based on a local convexification algorithm. The architecture we propose permits the generation of the additional triangles required to join the models and thereby avoid the discontinuities. The architecture is simple and regular and a high triangle generation rate is achieved. Different optimizations have been performed that avoid waiting cycles between tessellator units and so increase the productivity rate of the system. Implementation results are shown for a Virtex-II FPGA as an application example.