{"title":"A Hierarchical Model for Multiresolution Surface Reconstruction","authors":"Andreas Voigtmann , Ludger Becker, Klaus Hinrichs","doi":"10.1006/gmip.1997.0436","DOIUrl":null,"url":null,"abstract":"<div><p>The approximation of topographical surfaces is required in a variety of disciplines, for example, computer graphics and geographic information systems (GIS). The constrained Delaunay pyramid is a hierarchical model for approximating 2<span><math><mtext>1</mtext><mtext>2</mtext></math></span>-dimensional surfaces at a variety of predefined resolutions. Basically, the topographical data are given by a set of three-dimensional points, but an additional set of nonintersecting line segments describing linear surface features like valleys, ridges, and coast lines is required to constrain the representation. The approximation is obtained by computing a constrained Delaunay triangulation for each resolution. The model generalizes the constraints at coarse resolutions. Due to its structure, the constrained Delaunay pyramid efficiently supports browsing and zooming in large data sets stored in database systems underlying the GIS. For very large data sets, a divide-and-conquer approach allows the computation of the constrained Delaunay pyramid on secondary storage.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"59 5","pages":"Pages 333-348"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1997.0436","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077316997904366","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
The approximation of topographical surfaces is required in a variety of disciplines, for example, computer graphics and geographic information systems (GIS). The constrained Delaunay pyramid is a hierarchical model for approximating 2-dimensional surfaces at a variety of predefined resolutions. Basically, the topographical data are given by a set of three-dimensional points, but an additional set of nonintersecting line segments describing linear surface features like valleys, ridges, and coast lines is required to constrain the representation. The approximation is obtained by computing a constrained Delaunay triangulation for each resolution. The model generalizes the constraints at coarse resolutions. Due to its structure, the constrained Delaunay pyramid efficiently supports browsing and zooming in large data sets stored in database systems underlying the GIS. For very large data sets, a divide-and-conquer approach allows the computation of the constrained Delaunay pyramid on secondary storage.