{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:29:31Z","timestamp":1759336171791},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CVGIP: Graphical Models and Image Processing"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/1049-9652(92)90062-3","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T14:33:15Z","timestamp":1094653995000},"page":"147-161","source":"Crossref","is-referenced-by-count":36,"title":["Hierarchical triangulation using cartographic coherence"],"prefix":"10.1016","volume":"54","author":[{"given":"Lori","family":"Scarlatos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Theo","family":"Pavlidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1985","author":"Preparata","key":"10.1016\/1049-9652(92)90062-3_BIB1"},{"key":"10.1016\/1049-9652(92)90062-3_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02187904","article-title":"Nonobtuse triangulation of polygons","volume":"3","author":"Baker","year":"1988","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/1049-9652(92)90062-3_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0020-0190(79)90104-2","article-title":"Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation","volume":"9","author":"Manacher","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/1049-9652(92)90062-3_BIB4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0734-189X(84)90184-1","article-title":"Survey: Systematic triangulations","volume":"26","author":"Watson","year":"1984","journal-title":"Comput. Vision, Graphics Image Process."},{"year":"1974","author":"Aho","key":"10.1016\/1049-9652(92)90062-3_BIB5"},{"key":"10.1016\/1049-9652(92)90062-3_BIB6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(78)90062-5","article-title":"Triangulating a simple polygon","volume":"7","author":"Garey","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/1049-9652(92)90062-3_BIB7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/357337.357341","article-title":"Triangulating simple polygons and equivalent problems","volume":"3","author":"Fournier","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/1049-9652(92)90062-3_BIB8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02187741","article-title":"A fast Las Vegas algorithm for triangulating a simple polygon","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/1049-9652(92)90062-3_BIB9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0146-664X(75)90005-2","article-title":"Detection of surface-specific points by local parallel processing of discrete terrain elevation data","volume":"4","author":"Peucker","year":"1975","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/1049-9652(92)90062-3_BIB10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.3138\/D4L1-1525-N578-2578","article-title":"Experiments to locate ridges and channels to create a new type of digital elevation model","volume":"23","author":"Douglas","year":"1986","journal-title":"Cartographica"},{"issue":"4","key":"10.1016\/1049-9652(92)90062-3_BIB11","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TPAMI.1984.4767549","article-title":"Two-dimensional critical point configuration graphs","volume":"6","author":"Nackman","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intelligence"},{"key":"10.1016\/1049-9652(92)90062-3_BIB12","series-title":"presented at the National GIS Conference","article-title":"Phenomena-based terrain data modelling","author":"Feuchtwanger","year":"1989"},{"key":"10.1016\/1049-9652(92)90062-3_BIB13","first-page":"444","article-title":"Optimal tiling for large cartographic databases","volume":"9","author":"Goodchild","year":"1989"},{"key":"10.1016\/1049-9652(92)90062-3_BIB14","series-title":"Proceedings of Visualization '90","first-page":"176","article-title":"Rendering and managing spherical data with sphere quadtrees","author":"Fekete","year":"1990"},{"key":"10.1016\/1049-9652(92)90062-3_BIB15","series-title":"Proceedings of the IMAGE V Conference","first-page":"115","article-title":"A refined triangulation hierarchy for multiple levels of terrain detail","author":"Scarlatos","year":"1990"},{"key":"10.1016\/1049-9652(92)90062-3_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/MCG.1982.1674214","article-title":"The radial sweep algorithm for constructing triangulated irregular networks","volume":"2","author":"Mirante","year":"1982","journal-title":"IEEE Trans. Comput. Graphics Appl."},{"key":"10.1016\/1049-9652(92)90062-3_BIB17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the n-dimensional Delaunay tessellation with applications to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"Comput. J."},{"key":"10.1016\/1049-9652(92)90062-3_BIB18","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01840356","article-title":"Faster divide-and-conquer algorithm for constructing Delaunay triangulations","volume":"2","author":"Dwyer","year":"1987","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/1049-9652(92)90062-3_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/38.19053","article-title":"A pyramidal data structure for triangle-based surface description","volume":"9","author":"DeFloriani","year":"1989","journal-title":"IEEE Trans. Comput. Graphics Appl."},{"key":"10.1016\/1049-9652(92)90062-3_BIB20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"year":"1988","key":"10.1016\/1049-9652(92)90062-3_BIB21"},{"key":"10.1016\/1049-9652(92)90062-3_BIB22","series-title":"Proceedings of SIGGRAPH '79","first-page":"199","article-title":"Automatic extraction of irregularn network digital terrain models","author":"Fowler","year":"1979"},{"key":"10.1016\/1049-9652(92)90062-3_BIB23","unstructured":"Brad Lufkin, Report to the Project 2851 Industry\/Service Working Group, Planning Research Corporation, McLean, VA."},{"key":"10.1016\/1049-9652(92)90062-3_BIB24","first-page":"57","article-title":"Fitting a triangulation to contour lines","volume":"8","author":"Christensen","year":"1987"},{"key":"10.1016\/1049-9652(92)90062-3_BIB25","series-title":"Proceedings of SIGGRAPH","first-page":"187","article-title":"Conversion of complex contour line definition into polygonal element mosaics","author":"Christainsen","year":"1978"},{"key":"10.1016\/1049-9652(92)90062-3_BIB26","series-title":"Proceedings of SIGGRAPH","first-page":"69","article-title":"A new general triangulation method for planar contours","author":"Dennehy","year":"1982"},{"key":"10.1016\/1049-9652(92)90062-3_BIB27","series-title":"Proceedings of Auto-Carto 9","first-page":"146","article-title":"A compact terrain model based on critical topographic features","author":"Scarlatos","year":"1989"},{"key":"10.1016\/1049-9652(92)90062-3_BIB28","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","article-title":"Constrained Delaunay triangulations","volume":"4","author":"Chew","year":"1989","journal-title":"Algorithmica"},{"key":"10.1016\/1049-9652(92)90062-3_BIB29","first-page":"43","article-title":"An automated critical line detector for digital elevation matrices","volume":"Vol. 2","author":"Scarlatos","year":"1990"},{"issue":"2","key":"10.1016\/1049-9652(92)90062-3_BIB30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-8493(84)90054-2","article-title":"A hierarchical structure for surface approximation","volume":"8","author":"DeFloriani","year":"1984","journal-title":"Comput. and Graphics"},{"key":"10.1016\/1049-9652(92)90062-3_BIB31","series-title":"Proceedings of the IMAGE V Conference","first-page":"371","article-title":"A new visual system to support advanced requirements","author":"Cosman","year":"1990"}],"container-title":["CVGIP: Graphical Models and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:1049965292900623?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:1049965292900623?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T03:23:42Z","timestamp":1549250622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/1049965292900623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["1049965292900623"],"URL":"https:\/\/doi.org\/10.1016\/1049-9652(92)90062-3","relation":{},"ISSN":["1049-9652"],"issn-type":[{"type":"print","value":"1049-9652"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}