{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T09:24:25Z","timestamp":1783329865734,"version":"3.54.6"},"reference-count":296,"publisher":"Elsevier","isbn-type":[{"value":"9780444825377","type":"print"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/b978-044482537-7\/50008-5","type":"book-chapter","created":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T11:17:56Z","timestamp":1189250276000},"page":"333-388","source":"Crossref","is-referenced-by-count":25,"title":["Applications of Computational Geometry to Geographic Information Systems"],"prefix":"10.1016","author":[{"given":"Leila","family":"de Floriani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paola","family":"Magillo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enrico","family":"Puppo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/B978-044482537-7\/50008-5_bb0010","first-page":"24","article-title":"Surface approximation and geometric partitions","author":"Agarwal","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0015","article-title":"Applicable and robust geometric computing","author":"Agarwal","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0020","doi-asserted-by":"crossref","DOI":"10.1145\/263867.263869","article-title":"Approximating shortest paths on a convex polytope in three dimensions","author":"Agarwal","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0025","article-title":"Label placement by maximum independent sets in rectangles","author":"Agarwal","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0030","article-title":"Approximating shortest paths on a polyhedron","author":"Agarwal","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0035","article-title":"An efficient algorithm for terrain simplification","author":"Agarwal","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0040","first-page":"709","article-title":"Further comparison of algorithms for geometric intersection problems","author":"Andrews","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0045","first-page":"178","article-title":"Uniquely reporting spatial objects: Yet another operation for comparing spatial data structures","author":"Aref","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0050","series-title":"Geographic Information Systems: A Management Perspective","author":"Aronoff","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0055","first-page":"92","article-title":"Dynamic computational geometry","author":"Atallah","year":"1983"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0060","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1145\/116873.116880","article-title":"Voronoi diagrams \u2014 A survey of fundamental geometric data structures","volume":"23","author":"Aurenhammer","year":"1991","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0065","first-page":"159","article-title":"Algorithms for computing d\u2013dimensional Voronoi diagrams and their duals","author":"Avis","year":"1983"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0070","first-page":"39","article-title":"Fast isocontouring for improved interactivity","author":"Bajaj","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0075","series-title":"Theory and Practice of Geometric Modeling","article-title":"Automatic Reconstruction of 3D CAD Models","author":"Bajaj","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0080","first-page":"156","article-title":"\u039b shortest path algorithm for hierarchical terrain models","author":"Barrera","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0085","first-page":"589","article-title":"A polyhedral representation for computer vision","author":"Baumgart","year":"1975","journal-title":"Proceedings of the AFIPS National Computer Conference"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0090","first-page":"81","article-title":"The R*\u2013tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"issue":"9","key":"10.1016\/B978-044482537-7\/50008-5_bb0095","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TC.1979.1675432","article-title":"Algorithms for reporting and counting geometric intersections","volume":"28","author":"Bentley","year":"1979","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0100","series-title":"Advanced Geographic Data Modelling \u2014 Spatial Data Modelling and Query Languages for 2D and 3D Applications","first-page":"179","article-title":"Multiresolution topological maps","volume":"40","author":"Bertolotto","year":"1994"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0105","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/357346.357349","article-title":"Geometric structures for three-dimensional shape representation","volume":"3","author":"Boissonnat","year":"1984","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0110","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(90)90098-K","article-title":"Representing stereo data with the Delaunay triangulation","volume":"44","author":"Boissonnat","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0115","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF02293035","article-title":"Application of random sampling to on-line algorithms in computational geometry","volume":"8","author":"Boissonnat","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0120","first-page":"311","article-title":"On-line construction of the upper envelope of triangles in \u211d3","author":"Boissonnat","year":"1992"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0125","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","article-title":"Guarding polyhedral terrains","volume":"7","author":"Bose","year":"1997","journal-title":"Comput. Geom."},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_rf0130","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02189330","article-title":"Representing geometric structures in d dimensions: Topology and order","volume":"9","author":"Brisson","year":"1993","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0135","first-page":"70","article-title":"A fast algorithm for selective refinement of terrain meshes","author":"Brown","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0140","series-title":"Principles of Geographic Information Systems for Land Resources Assessment","author":"Burrough","year":"1986"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0145","first-page":"261","article-title":"Vector to raster conversion error and feature complexity: An empirical study using simulated data","volume":"8","author":"Carver","year":"1994","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0150","doi-asserted-by":"crossref","unstructured":"A. Carrara, G. Bitelli and R. Carl\u00e0, Comparison of techniques for generating digital terrain models from contour lines. Internat. J. Geogr. Inform. Sci. 11 (5), 451 \u2013474.","DOI":"10.1080\/136588197242257"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0155","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/147508.147511","article-title":"An optimal algorithm for intersecting line segment in the plane","volume":"39","author":"Chazelle","year":"1992","journal-title":"J. ACM"},{"issue":"Springer-Verlag","key":"10.1016\/B978-044482537-7\/50008-5_bb0160","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01182771","article-title":"Algorithms for bicliromatic line-segment problem and polyhedral terrains","volume":"11","author":"Chazelle","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0165","first-page":"263","article-title":"A simple trapezoidal sweep algorithm for reporting red\/blue segment intersections","author":"Chan","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0170","first-page":"50","article-title":"Systematic selection of very important points (VIP) from digital terain model for constructing triangular irregular networks","author":"Chen","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0175","first-page":"360","article-title":"Shortest paths on a polyhedron","author":"Chen","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0180","first-page":"41","article-title":"Approximate Euclidean shortest path in 3-space","author":"Choi","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0185","first-page":"347","article-title":"Optimized geometry compression for real-time rendering","volume":"97","author":"Chow","year":"1997","journal-title":"Proceedings IEEE Visualization"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0190","first-page":"57","article-title":"Fitting a triangulation to contour lines","author":"Christensen","year":"1987"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0195","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/212332.212334","article-title":"An empirical study of algorithms for point-feature placement","volume":"14","author":"Christensen","year":"1995","journal-title":"ACM Trans. on Graphics"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb0200","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/s003710050101","article-title":"Multiresolution decimation based on global error","volume":"13","author":"Ciampalini","year":"1997","journal-title":"The Visual Computer"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0205","doi-asserted-by":"crossref","DOI":"10.1007\/s003710050099","article-title":"Representation and visualization of terrain surfaces at variable resolution","volume":"13","author":"Cignoni","year":"1997","journal-title":"The Visual Computer"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb0210","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Application of random sampling in computer geometry","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0215","first-page":"149","article-title":"A comparison of methods for representing topological relationships","volume":"3","author":"Clementini","year":"1995","journal-title":"Inform. Sci."},{"issue":"1\u20134","key":"10.1016\/B978-044482537-7\/50008-5_bb0220","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0255(95)00289-8","article-title":"A model for representing topological relationships between complex geometric features in spatial databases","volume":"90","author":"Clementini","year":"1996","journal-title":"Inform. Sci."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0225","first-page":"119","article-title":"Simplification envelopes","author":"Cohen","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0230","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","article-title":"Visibility problems for polyhedral terrains","volume":"17","author":"Cole","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0235","article-title":"Topological principles in cartography","author":"Corbett","year":"1979"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0240","first-page":"38","article-title":"A spatial allocation analysis of the point annotation problem","author":"Cromley","year":"1986"},{"issue":"6","key":"10.1016\/B978-044482537-7\/50008-5_bb0245","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0910064","article-title":"On optimal interpolation triangle incidences","volume":"20","author":"D\u2019Azavedo","year":"1989","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0250","article-title":"Ray shooting. Depth Orders and Hidden Surface Removal","volume":"703","author":"de Berg","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0255","doi-asserted-by":"crossref","DOI":"10.1145\/220279.220334","article-title":"On the levels of detail in terrains","author":"de Berg","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf0255","first-page":"79","article-title":"A new approach to subdivision simplification","author":"dc Berg","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0265","first-page":"325","article-title":"The complexity of rivers in triangulated terrains","author":"de Berg","year":"1996"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0270","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1080\/136588197242310","article-title":"Simple traversal of a subdivision without extra storage","volume":"11","author":"dc Berg","year":"1997","journal-title":"Internat. J. Geogr. Inform. Sci"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0275","doi-asserted-by":"crossref","unstructured":"M. de Berg and M. van Kreveld, Trekking in the alps without freezing or getting tired, Algorithmica 18, 306\u2013323.","DOI":"10.1007\/PL00009159"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0280","first-page":"13","article-title":"Geometry compression","author":"Deering","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0285","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/38.19053","article-title":"A pyramidal data structure for triangle-based surface description","volume":"8","author":"De Floriani","year":"1989","journal-title":"IEEE Comput. Graphics Appl."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0290","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1007\/BF01759057","article-title":"On sorting triangles in a Delaunay tesselation","volume":"6","author":"De Floriani","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0295","series-title":"Spatial Information Theory \u2014 A theoretical basis for GIS","first-page":"113","article-title":"Spatial queries and data models","volume":"716","author":"De Floriani","year":"1993"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0300","first-page":"329","article-title":"Line-of-sight communication on a terrain models","volume":"8","author":"De Floriani","year":"1994","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0305","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01898599","article-title":"Horizon computation on a hierarchical terrain model","volume":"11","author":"Dc Floriani","year":"1995","journal-title":"The Visual Computer: An International Journal of Computer Graphics"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0310","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/225294.225297","article-title":"Hierarchical triangulation for multiresolution surface description","volume":"14","author":"De Floriani","year":"1995","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0315","article-title":"A formal approach to multiresolution modeling","author":"De Floriani","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0320","first-page":"103","article-title":"Building and traversing a surface at variable resolution","author":"De Floriani","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0325","article-title":"Efficient encoding and retrieval of triangle meshes at variable resolution","author":"De Floriani","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0330","first-page":"43","article-title":"Efficient implementation of multi\u2013triangulations","author":"De Floriani","year":"1998"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0335","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1009708413602","article-title":"Visibility computations on hierarchical triangulated terrain models","volume":"1","author":"Dc Floriani","year":"1997","journal-title":"Geoin\u2013 formatica"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0340","article-title":"On the assessment of generalization consistency","author":"Delis","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0345","article-title":"How generalization interacts with the topological and geometric structure of maps","author":"Dettori","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0350","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-57568-5_231","article-title":"Remembering conflicts in history yields dynamic algorithms","volume":"762","author":"Dobrindt","year":"1993","journal-title":"Lecture Notes in Comput. Sci."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0355","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/129617.129620","article-title":"A rule\u2013based system for dense\u2013map name placement","volume":"35","author":"Doerschler","year":"1992","journal-title":"Communications of the ACM"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0360","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1111\/j.0033-0124.1985.00075.x","article-title":"Ad algorithm to construct continuous area cartograms","volume":"37","author":"Dougenik","year":"1985","journal-title":"Professional Geographer"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb0365","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas","year":"1973","journal-title":"The Canadian Cartographer"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0370","first-page":"81","article-title":"ROAMing terrain: Real\u2013time optimally adapting meshes","author":"Duchaineau","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0375","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0380","doi-asserted-by":"crossref","first-page":"188","DOI":"10.3138\/R613-191U-7255-082N","article-title":"Geodesic modelling of planetary relief","volume":"21","author":"Dutton","year":"1988","journal-title":"Cartographica"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0385","first-page":"49","article-title":"Polyhedral hierarchical tessellation: The shape of GIS to come","volume":"2","author":"Dutton","year":"1991","journal-title":"Geo Info Systems"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_rf0380","first-page":"253","article-title":"Improving locational specificity of map data \u2014 a multiresolution, metadata\u2013driven approach and notation","volume":"10","author":"Dutton","year":"1996","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0395","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1093\/imanum\/10.1.137","article-title":"Data dependent triangulations for piecewise linear interpolation","volume":"10","author":"Dyn","year":"1990","journal-title":"IMA J. Numer. Anal."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0400","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0405","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF02187733","article-title":"The upper envelope of piecewise linear functions: Algorithms and applications","volume":"4","author":"Edelsbrunner","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0410","first-page":"43","article-title":"Incremental topological flipping works for regular triangulations","author":"Edelsbrunner","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0415","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0925-7721(96)00006-5","article-title":"A combinatorial approach to cartograms","volume":"7","author":"Edelsbrunner","year":"1997","journal-title":"Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0420","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02573974","article-title":"An upper bound for conforming Delaunay triangulations","volume":"10","author":"Edelsbrunner","year":"1993","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0425","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/174462.156635","article-title":"Three\u2013dimensional alpha shapes","volume":"13","author":"Edelsbrunner","year":"1994","journal-title":"ACM Trans, on Graphics"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb0430","first-page":"161","article-title":"Point\u2013set topological spatial relations","volume":"5","author":"Egenhofer","year":"1991","journal-title":"Internat. J. Geogr. Inform. Systems"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb0435","first-page":"129","article-title":"Topological relations between regions with holes","volume":"8","author":"Egenhofer","year":"1994","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0440","first-page":"901","article-title":"Evaluating inconsistencies among multiple representations","author":"Egenhofer","year":"1994"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0445","first-page":"329","article-title":"Rapide generation of digital elevation models from topographic maps","volume":"9","author":"Eklundh","year":"1995","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0450","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/VISUAL.1996.568125","article-title":"Optimizing triangle strips for fast rendering","volume":"96","author":"Evans","year":"1996","journal-title":"Proceedings IEEE Visualization"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0455","article-title":"Right triangular irregular networks","author":"Evans","year":"1997"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0460","first-page":"397","article-title":"A new method for the characterization of topographic surfaces","volume":"5","author":"Falcidieno","year":"1991","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0465","article-title":"Hilbert R\u2013tree: An improved R\u2013tree using fractals","author":"Faloutsos","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0470","first-page":"4","article-title":"Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension","author":"Faloutsos","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0475","series-title":"Advances in Spatial Databases","first-page":"29","article-title":"The quad view data structure - A representation for planar subdivisions","volume":"951","author":"Finke","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0480","first-page":"119","article-title":"Overlaying simply connected planar subdivisions in linear time","author":"Finke","year":"1995"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0485","first-page":"331","article-title":"Algorithm and implementation uncertainty in viewshed analysis","volume":"7","author":"Fisher","year":"1993","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0490","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01891833","article-title":"Analytic variations on quedtrees","volume":"10","author":"Flajolet","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0495","series-title":"Computer Graphics: Principles and Practice","author":"Foley","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0500","first-page":"281","article-title":"A packing problem with applications to lettering of maps","author":"Formann","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0505","first-page":"163","article-title":"Efficient exact arithmetic for computational geometry","author":"Fortune","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0510","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/965103.807444","article-title":"Automatic extraction of irregular digital terrain models","volume":"13","author":"Fowler","year":"1979","journal-title":"Computer Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0515","first-page":"411","article-title":"Cell graph: A provable correct method for the storage of geometry","author":"Frank","year":"1986"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf0510","first-page":"585","article-title":"Formal methods for the accurate definition of some fundamental terms in physical geography","author":"Frank","year":"1986"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0525","first-page":"A62","article-title":"Efficient intersection calculations in large databases","author":"Franklin","year":"1989"},{"issue":"7","key":"10.1016\/B978-044482537-7\/50008-5_bb0530","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0010-4485(89)90125-5","article-title":"Geometric computing and the uniform grid data technique","volume":"21","author":"Franklin","year":"1989","journal-title":"Computer Aided Design"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0535","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0098-3004(92)90070-8","article-title":"Spatial concepts, geometric data models, and data structures","volume":"18","author":"Frank","year":"1992","journal-title":"Computers and Geosciences"},{"issue":"6","key":"10.1016\/B978-044482537-7\/50008-5_bb0540","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/0097-8493(94)90008-6","article-title":"Multiple representations for cartographic objects in a multiscale tree \u2014 An intelligent graphical zoom","volume":"18","author":"Frank","year":"1994","journal-title":"Computers & Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0545","article-title":"Triangulated irregular network to approximate digital terrain","author":"Franklin","year":"1994"},{"issue":"10","key":"10.1016\/B978-044482537-7\/50008-5_bb0550","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1145\/359842.359846","article-title":"Optimal surface reconstruction from planar contours","volume":"20","author":"Fuchs","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0555","first-page":"411","article-title":"A contour\u2013line based triangulation algorithm","author":"Garcia","year":"1992"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0560","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/965145.801264","article-title":"A new general triangulation method for planar contours","volume":"16","author":"Ganapathy","year":"1982","journal-title":"Computer Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0565","first-page":"266","article-title":"Path planning in 0\/1\/\u221e weighted regions with applications","author":"Gewali","year":"1988"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0570","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","article-title":"Computing the visibility polygon from a convex set and related problems","volume":"12","author":"Ghosh","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0575","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1139\/geomat-1991-0005","article-title":"Problems with handling spatial data \u2014 the Voronoi approach","volume":"45","author":"Gold","year":"1991","journal-title":"CISM J."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0580","first-page":"495","article-title":"An object\u2013based dynamic spatial model, and its application in the development of a user\u2013 friendly digitizing system","author":"Gold","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0585","first-page":"121","article-title":"Dynamic data structures","volume":"40","author":"Gold","year":"1994","journal-title":"Netherlands Geodetic Commission, Publication on Geodesy \u2014 New Series"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0590","first-page":"70","article-title":"Surface modeling with guaranteed consistency \u2014 an object\u2013based approach","volume":"884","author":"Gold","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0595","first-page":"53","article-title":"A digital model for three\u2013dimensional surface representation","volume":"1","author":"Gomez","year":"1979","journal-title":"Geoprocessing"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0600","series-title":"National Center for Geographic Information Analysis","article-title":"NCGIA Core Curriculum","author":"Goodchild","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0605","first-page":"31","article-title":"A hierarchical data structure for global geographic information systems","volume":"54","author":"Goodchild","year":"1992","journal-title":"Computer Vision, Graphics and linage Process"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0610","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/1049-9652(92)90029-W","article-title":"A polygonal approach to hidden line and hidden surface elimination","volume":"54","author":"Goodrich","year":"1992","journal-title":"Graphical Models and Image Process."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0615","doi-asserted-by":"crossref","unstructured":"M.H. Gross, O.G. Staadt and R. Gatti, Efficient triangular surface approximation using wavelets and quadtree data structures. IEEE Trans. Visualization and Computer Graphics 2 (2), 130\u2013143.","DOI":"10.1109\/2945.506225"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0620","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","article-title":"Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams","volume":"4","author":"Guibas","year":"1985","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0625","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02187878","article-title":"Computing convolutions by reciprocal search","volume":"2","author":"Guibas","year":"1987","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0630","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1142\/S0218195993000257","article-title":"Approximating polygons and subdivisions with minimum\u2013link paths","volume":"3","author":"Guibas","year":"1983","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0635","first-page":"190","article-title":"Rounding arrangements dynamically","author":"Guibas","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0640","first-page":"47","article-title":"R\u2013trees: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf0630","first-page":"14","article-title":"Realms: A foundation for spatial data types in database systems","author":"G\u00fcting","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0650","first-page":"216","article-title":"Implementation of the ROSE algebra: Efficient algorithms for realm\u2013based spatial data types","volume":"951","author":"G\u00fcting","year":"1995"},{"issue":"Springer-Verlag","key":"10.1016\/B978-044482537-7\/50008-5_bb0655","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-55966-3_15","article-title":"A model for expressing topological integrity constraints in geographic databases","volume":"639","author":"Hadzilacos","year":"1992","journal-title":"Lecture Notes in Comput. Sci"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0660","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8396(94)90032-9","article-title":"\u039b data reduction scheme for triangulated surfaces","volume":"11","author":"Hamman","year":"1994","journal-title":"Comput. Aided Geom. Design"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0665","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0734-189X(83)90094-4","article-title":"Ridges and valleys on digital images","volume":"22","author":"Haralick","year":"1983","journal-title":"Computer Vision, Graphics and Image Process"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0670","first-page":"329","article-title":"Approximate shortest paths on a convex polytope in three dimensions","author":"Har\u2013Peled","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0675","first-page":"381","article-title":"Image encoding with triangulation wavelets","volume":"1","author":"Hebert","year":"1995","journal-title":"Proceedings SPIE 2569"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0680","article-title":"Survey of polygonal surface simplification algorithms","author":"Heckbert","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0685","first-page":"282","article-title":"TIGRIS: Topologically integrated GIS","author":"Herring","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0690","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","article-title":"Finding the upper envelope of n line segments in O(n log\u201d) time","volume":"33","author":"Hershberger","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0695","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","article-title":"Computing minimum length paths of a given homotopy class","volume":"4","author":"Hershberger","year":"1994","journal-title":"Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0700","article-title":"Cartographic line simplification and polygon CSG formulae in O(n log* n)time","author":"Hershberger","year":"1997"},{"issue":"Springer-Verlag","key":"10.1016\/B978-044482537-7\/50008-5_bb0705","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-60159-7_6","article-title":"Ranking in spatial databases","volume":"951","author":"Hjaltason","year":"1995","journal-title":"Lecture Notes in Comput. Sci"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0710","series-title":"Advances in Spatial Databases","article-title":"Efficient processing of spatial queries in line segment database","volume":"525","author":"Hoel","year":"1991"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0715","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/2.16223","article-title":"The problems of accuracy and robustness in computational geometry","volume":"22","author":"Hoffmann","year":"1989","journal-title":"IEEE Computer"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0720","series-title":"The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling","article-title":"Geometric and Solid Modeling: An Introduction","author":"Hoffmann","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0725","first-page":"71","article-title":"Surface reconstruction from unorganized points","author":"Hoppe","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0730","first-page":"99","article-title":"Progressive meshes","author":"Hoppe","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0735","doi-asserted-by":"crossref","DOI":"10.1145\/258734.258843","article-title":"View\u2013dependent refinement of progressive meshes","author":"Hoppe","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0740","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","article-title":"Computational\u2013geometric methods for polygonal approximations of a curve","volume":"36","author":"Imai","year":"1986","journal-title":"Comput. Vision, Graphics and Image Process"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0745","first-page":"159","article-title":"An optimal algorithm for approximating a piecewise linear function","volume":"9","author":"Imai","year":"1986","journal-title":"J. Inform. Process"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0750","series-title":"Computational Morphology","first-page":"71","article-title":"Polygonal approximation of u curve \u2014 formulations and algorithms","author":"Imai","year":"1988"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0755","first-page":"1593","article-title":"Extracting topographic structure from digital elevation data for geographic information system analysis","volume":"54","author":"Jenson","year":"1988","journal-title":"Photogramm. Eng. Remote Sensing"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb0760","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0167-8396(91)90038-D","article-title":"Construction of three\u2013dimensional Delaunay triangulations using local transformations","volume":"8","author":"Joe","year":"1991","journal-title":"Comput. Aided Geom. Design"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb0765","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/38.35536","article-title":"Cartographic name placement with Prolog","volume":"9","author":"Jones","year":"1989","journal-title":"IEEE Comput. Graphics Appl."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_rf0755","first-page":"15","article-title":"Data structures for three\u2013dimensional spatial information systems in geology","volume":"3","author":"Jones","year":"1989","journal-title":"Internat. J. Geogr. Inform. Systems"},{"issue":"4","key":"10.1016\/B978-044482537-7\/50008-5_bb0775","first-page":"317","article-title":"Map generalization with a triangulated data structure","volume":"22","author":"Jones","year":"1995","journal-title":"Cartography and Geographic Information Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0780","article-title":"A fuzzy relational path algebra for distances and directions","author":"Jorge","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0785","first-page":"814","article-title":"Spatial relationships \u2014 Topology versus order","author":"Kainz","year":"1990"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0790","first-page":"215","article-title":"Modeling spatial relations and operations with partially ordered sets","volume":"7","author":"Kainz","year":"1993","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0795","first-page":"3140","article-title":"Efficient hidden surface removal for objects with small union size","author":"Katz","year":"1991"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0800","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1147\/rd.191.0002","article-title":"Approximating complex surfaces by triangulation of contour lines","volume":"19","author":"Keppel","year":"1975","journal-title":"IBM J. Research and, Development"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0805","first-page":"18","article-title":"Efficient computation of continuous skeletons","author":"Kirkpatrick","year":"1979"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0810","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."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0815","series-title":"Theory and Practice of Geometric Modeling","article-title":"Generation of multiresolution models from CAD data for real time rendering","author":"Klein","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0820","first-page":"2","article-title":"Local features of smooth shapes: Ridges and courses","volume":"2031","author":"Koenderik","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0825","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0167-8655(94)90134-1","article-title":"Two\u2013plus\u2013one\u2013dimensional differential geometry","volume":"15","author":"Koenderik","year":"1994","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0830","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0734-189X(89)90147-3","article-title":"Digital topology: Introduction and survey","volume":"48","author":"Kong","year":"1989","journal-title":"Comput. Vision, Graphics and image Process"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0835","first-page":"5","article-title":"The combination of spatial access methods and Computational Geometry in Geographic Database Systems","author":"Kriegei","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0840","first-page":"16","article-title":"An efficient map overlay algorithm based on Spatial Access Methods and Computational Geometry","author":"Kriegel","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0845","first-page":"317","article-title":"Exact algorithms for a geometric packing problem","volume":"665","author":"Kucera","year":"1993"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb0850","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/cviu.1994.1013","article-title":"Extracting topological terrain features from elevation maps","volume":"59","author":"Kweon","year":"1994","journal-title":"Coinput. Vision, Graphics and Image Process."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0855","first-page":"274","article-title":"Approximating weighted shortest paths on polyhedral surfaces","author":"Lanthier","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0860","series-title":"Fundamentals of Spatial Information Systems","author":"Laurini","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0865","series-title":"Mathematical Software III","first-page":"161","article-title":"Software for C1 surface interpolation","author":"Lawson","year":"1977"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0870","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","article-title":"Generalized Delaunay triangulation for planar graphs","volume":"1","author":"Lee","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0875","first-page":"30","article-title":"A drop heuristic conversion method for extracting irregular networks for digital elevation models","author":"Lee","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0880","first-page":"413","article-title":"Analyses of visibility sites on topographic surfaces","volume":"5","author":"Lee","year":"1991","journal-title":"Internat. J. Geogr. Inform. Systems"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb0885","first-page":"373","article-title":"Algorithms for automated line generalization based on a natural principle of objective generalization","volume":"6","author":"Li","year":"1992","journal-title":"Internat. J. Geogr. Inform. Systems"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0890","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0010-4485(91)90082-8","article-title":"Topological models for boundary representations: a comparison with n\u2013dimensional generalized maps","volume":"23","author":"Lienhardt","year":"1991","journal-title":"Comput. Aided Design"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf0880","first-page":"109","article-title":"Real\u2013time, continuous level of detail rendering of height fields","author":"Lindstrom","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0900","first-page":"156","article-title":"Robust proximity queries: An illustration of degree\u2013driven algorithm design","author":"Liotta","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0905","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1109\/2945.489388","article-title":"A near optimal isosurface extraction algorithm using the span space","volume":"2","author":"Livnat","year":"1996","journal-title":"IEEE Trans. Visualization and Comput. Graphics"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0910","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/237748.237750","article-title":"Multiresolution analysis of surfaces of arbitrary topological type","volume":"16","author":"Lounsbery","year":"1997","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0915","first-page":"164","article-title":"Hipparchus data structures: Points, lines and regions in spherical Voronoi grid","volume":"9","author":"Lukatela","year":"1989","journal-title":"Proceedings Auto\u2013Carto"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0920","series-title":"The Topology of CW Complexes","author":"Lundell","year":"1969"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0925","first-page":"190","article-title":"Maintaining multiple levels of detail in the overlay of hierarchical subdivisions","author":"Magillo","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0930","series-title":"Parallel Processing Algorithms for GIS","article-title":"Algorithms for parallel terrain modelling and visualisation","author":"Magillo","year":"1998"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0935","doi-asserted-by":"crossref","DOI":"10.1145\/267825.267834","article-title":"Progressive TINs: Algorithms and applications","author":"Maheshwari","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0940","series-title":"An Introduction to Solid Modeling","author":"M\u00e4ntyl\u00e4","year":"1988"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0945","article-title":"Topological properties of geographic surfaces: Applications in computer carthography","author":"Mark","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0950","first-page":"264","article-title":"A new algorithm for computing shortest paths in a weighted planar sub\u2013 sivision","author":"Mata","year":"1997"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0955","first-page":"263","article-title":"Feature\u2013based derivation of drainage networks","volume":"7","author":"Me Cormack","year":"1993","journal-title":"Internat. J. GIS"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0960","first-page":"19","article-title":"Worst case optimal hidden surface removal","author":"McKenna","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0965","doi-asserted-by":"crossref","first-page":"74","DOI":"10.3138\/3535-7609-781G-4L20","article-title":"Automated line generalization","volume":"24","author":"McMaster","year":"1984","journal-title":"Cartographica"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb0970","first-page":"433","article-title":"The digital terrain model \u2014 theory und applications","volume":"24","author":"Miller","year":"1958","journal-title":"Photogramm. Eng."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0975","first-page":"6.35","article-title":"Varioscale TIN based surfaces","author":"Misund","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0980","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/0216045","article-title":"The discrete geodesic problem","volume":"16","author":"Mitchell","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0985","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/102782.102784","article-title":"The weighted region problem: Finding shortest paths through a weighted planar subsivision","volume":"38","author":"Mitchell","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb0990","first-page":"439","article-title":"A survey of computational geometry","volume":"7","author":"Mitchell","year":"1995"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb0995","article-title":"Single valued vector maps \u2014 a concept in GIS","volume":"2","author":"Molenaar","year":"1989","journal-title":"Geo\u2013Informations systeme"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1000","series-title":"Geometric Modeling","author":"Mortenson","year":"1985"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1005","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0169-555X(88)90011-6","article-title":"Automatically derived catchment boundaries and channel networks and their hydrological applications","volume":"1","author":"Morris","year":"1988","journal-title":"Geomorphology"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1010","doi-asserted-by":"crossref","DOI":"10.21236\/ADA166246","article-title":"On finding shortest paths on convex polyhedra","author":"Mount","year":"1985"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1015","series-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"Mulmuley","year":"1994"},{"issue":"6","key":"10.1016\/B978-044482537-7\/50008-5_bb1020","doi-asserted-by":"crossref","DOI":"10.1016\/0097-8493(94)90002-7","article-title":"Terrain visibility","volume":"18","author":"Nagy","year":"1994","journal-title":"Comput. Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1025","article-title":"The LEDA user manual. Version 3.1","author":"N\u00e4her","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1030","first-page":"115","article-title":"Merging BSP\u2013trees yelds polyhedral set operations","volume":"24","author":"Naylor","year":"1990"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_rf1020","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1109\/38.180119","article-title":"Scattered data modeling","volume":"13","author":"Nielson","year":"1993","journal-title":"IEEE Comput. Graphics Appl."},{"issue":"10","key":"10.1016\/B978-044482537-7\/50008-5_bb1040","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane sweep algorithms for intersecting geometric figures","volume":"25","author":"Nievergelt","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1045","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/BF01935366","article-title":"A fast line\u2013sweep algorithm for hidden line elimination","volume":"25","author":"Nurmi","year":"1985","journal-title":"BIT"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1050","series-title":"Inventor Mentor: Openlnventor Reference Manual","author":"Openlnventor Architecture Group","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1055","first-page":"381","article-title":"An algorithm for computing the overlay of k\u2013dimensional spaces","volume":"525","author":"Orenstein","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/102377.112141","article-title":"A simple output\u2013sensitive algorithm for hidden surface removal","volume":"11","author":"Overmars","year":"1992","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1065","article-title":"Designing the computational geometry algorithms library COAL","author":"Overmars","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1070","first-page":"530","article-title":"Counting and reporting reil\/blue segment intersections","volume":"709","author":"Palazzi","year":"1993"},{"issue":"6","key":"10.1016\/B978-044482537-7\/50008-5_bb1075","first-page":"497","article-title":"Generation of multi\u2013resolution maps from run length\u2013encoded data","volume":"6","author":"Persson","year":"1992","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1080","first-page":"112","article-title":"Terrain Modelling in Survey and Civil Engineering","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1085","series-title":"Terrain Modelling in Survey and Civil Engineering","first-page":"112","article-title":"Modelling, interpolation and contouring procedures","author":"Petrie","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1090","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0146-664X(75)90005-2","article-title":"Detection of surface\u2013specific points by local parallel processing of discrete terrain elevation data","volume":"4","author":"Peucker","year":"1975","journal-title":"Comput. Graphics and Image Process."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1095","first-page":"89","article-title":"Generalized singular 3\u2013cell complexes","author":"Pigot","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1100","series-title":"Advanced Geographic Data Modelling \u2014 Spatial Data Modelling and Query Languages for 2D and 3D Applications","first-page":"129","article-title":"A tetrahedron\u2013based 3D vector data model for geoinformation","volume":"40","author":"Pilouk","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1105","series-title":"Digital Image Processing","author":"Pratt","year":"1978"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1110","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1115","first-page":"135","article-title":"A simplified technique for hidden\u2013line elimination in terrains","volume":"577","author":"Preparata","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1120","series-title":"Advances in Spatial Databases","first-page":"152","article-title":"Towards a forma! model for multiresolution spatial maps","volume":"951","author":"Puppo","year":"1995"},{"issue":"3\u20134","key":"10.1016\/B978-044482537-7\/50008-5_bb1125","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0925-7721(98)00029-7","article-title":"Variable resolution terrain surfaces. Proceedings Canadian Conference on Computational Geometry, Ottawa (Canada) 12\u201315 August, 1996: appeared in longer version as Variable resolution triangulations","volume":"11","author":"Puppo","year":"1998","journal-title":"Comput. Geom."},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb1130","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/136588197242437","article-title":"Discrete visibility problems and graph algorithms","volume":"11","author":"Puppo","year":"1997","journal-title":"Internat. J. Geogr. Inform. Sci."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1135","article-title":"Simplification, LOD. and multiresolution \u2014 Principles and applications","author":"Puppo","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1140","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02574375","article-title":"Optimality of the Delaunay triangulation in Rd","volume":"12","author":"Rajan","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1145","series-title":"Three Dimensional Applications in Geographic Information Systems","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1150","first-page":"193","article-title":"An efficient output\u2013sensitive hidden\u2013surface removal algorithm and its parallelization","author":"Reif","year":"1988"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf1140","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0167-8396(90)90011-F","article-title":"Minimal roughness property of Delaunay triangulation","volume":"7","author":"Rippa","year":"1990","journal-title":"Comput. Aided Geom. Design"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb1160","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1137\/0913065","article-title":"Adaptive approximations by piecewise linear polynomials on triangulations of subsets of scattered data","volume":"13","author":"Rippa","year":"1992","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1165","article-title":"Elements of Cartography","author":"Robinson","year":"1984"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1170","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1145\/88560.88572","article-title":"Fast line scan\u2013conversion","volume":"9","author":"Rokne","year":"1990","journal-title":"ACM Trans, on Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1175","article-title":"Digital picture processing","volume":"1","author":"Rosenfeld","year":"1982"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1180","first-page":"17","article-title":"Direct spatial search on pictorial databases using packed R\u2013trees","author":"Roussopoulos","year":"1985"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1185","first-page":"380","article-title":"On the difficulty of tetrahedralizing 3\u2013dimensional non\u2013convex polyhedra","author":"Ruppert","year":"1989"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1190","first-page":"195","article-title":"Joint triangulations and triangulation maps","author":"Saalfeld","year":"1987"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb1195","first-page":"217","article-title":"Conflation: Automatic map compilation","volume":"2","author":"Saalfeld","year":"1988","journal-title":"Intemat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1200","first-page":"33","article-title":"Delaunay edge refinements","author":"Saalfeld","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1205","article-title":"Comflation: Automated map compilation","author":"Saalfeld","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1210","first-page":"444","article-title":"Map generalization as a graph drawing problem","volume":"894","author":"Saalfeld","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1215","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1220","series-title":"Applications of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1225","series-title":"Advances in Image Understanding \u2014 A Festschrift for Azriel Rosenfeld","first-page":"316","article-title":"Object\u2013based and image\u2013based representations of objects by their interiors","author":"Samet","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1230","first-page":"43","article-title":"An automatic critical line detector for digital elevation matrices","author":"Scarlatos","year":"1990"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb1235","first-page":"147","article-title":"Hierarchical triangulation using cartographic coherence","volume":"54","author":"Scarlatos","year":"1992","journal-title":"CVGIP: Graphical Models and Image Processing"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1240","first-page":"43","article-title":"Time and space bounds for hidden line and hidden surface algorithms","author":"Schmitt","year":"1981"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1245","first-page":"223","article-title":"An optimal algorithm for constructing the Delaunay triangulation of a set of line segments","author":"Schubert","year":"1987"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb1250","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/142920.134010","article-title":"Decimation of triangle mesh","volume":"26","author":"Schroeder","year":"1992","journal-title":"ACM Comput. Graphics"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1255","first-page":"507","article-title":"The R\u2019 \u2013tree: A dynamic index for multidimensional objects","author":"Sellis","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1260","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","article-title":"On shortest paths on polyhedral spaces","volume":"15","author":"Sharir","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1265","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0020-0190(88)90120-2","article-title":"The shortest watchtower and related problems for polyhedral terrains","volume":"29","author":"Sharir","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1270","first-page":"201","article-title":"Automatic generation of triangular irregular networks using greedy cuts","author":"Silva","year":"1995"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb1275","first-page":"33","article-title":"Terrain position as mapped from gridded digital elevation model","volume":"4","author":"Skidmore","year":"1990","journal-title":"Intemat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1280","first-page":"45","article-title":"Surface reconstruction from sparse data","author":"Sloan","year":"1981"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1285","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63397-9_35","article-title":"Linear\u2013time reconstruction of Delaunay triangulations with applications","author":"Snoeyink","year":"1997"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1290","article-title":"Piecewise linear surface models from sampled data","author":"Southard","year":"1991"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf1280","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0734-189X(86)90127-1","article-title":"A linear time algorithm for minimum link paths inside a simple polygon","volume":"35","author":"Suri","year":"1986","journal-title":"Comput. Vision, Graphics and Image Process"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1300","first-page":"76","article-title":"Wavelets for computer graphics: A primer, Part I","author":"Stollnitz","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1305","first-page":"75","article-title":"Wavelets for computer graphics: A primer, Pan II","author":"Stollnitz","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1310","article-title":"Strategic directions in computational geometry working group report","volume":"28","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1315","article-title":"Geometrie compression through topological surgery","author":"Taubin","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1320","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1111\/j.1749-6632.1973.tb41401.x","article-title":"A continuous transformation useful for districting","volume":"219","author":"Tobler","year":"1973","journal-title":"Ann. New York Acad. Sci."},{"issue":"6","key":"10.1016\/B978-044482537-7\/50008-5_bb1325","first-page":"501","article-title":"Delaunay triangulations in TIN creation: An overview and a linear\u2013time algorithm","volume":"7","author":"Tsai","year":"1993","journal-title":"Internat. J. GIS"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1330","first-page":"55","article-title":"Re\u2013tiling polygonal surfaces","volume":"26","author":"Turk","year":"1992"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1335","first-page":"309","article-title":"Vector vs. raster\u2013based algorithms for cross country movement planning","author":"van Bemmelen","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1340","first-page":"115","article-title":"3D computational morphology","author":"Veitkamp","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1345","first-page":"113","article-title":"On quality paths on polyhedral terrains","volume":"884","author":"van Kreveld","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1350","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1080\/02693799608902095","article-title":"Efficient methods for isoline extraction from a TIN","volume":"10","author":"van Kreveld","year":"1996","journal-title":"Internat. J. Geogr. Inform. Science"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1355","article-title":"Digital elevation models and TIN algorithms","author":"van Kreveld","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1360","article-title":"Variations on sweep algorithms: Efficient computation of extended viewsheds and class intervals","author":"van Kreveld","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1365","first-page":"212","article-title":"Contour trees and small seed sets for isosurface traversal","author":"van Kreveld","year":"1997"},{"issue":"2","key":"10.1016\/B978-044482537-7\/50008-5_bb1370","first-page":"133","article-title":"A modified binary space partition for geographic information systems","volume":"4","author":"van Oosterom","year":"1990","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1375","series-title":"Reactive Data Structures for Geographic Information Systems","author":"van Oosterom","year":"1993"},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb1380","first-page":"489","article-title":"The development of an interactive multi\u2013scale GIS","volume":"9","author":"van Oosterom","year":"1995","journal-title":"Internat. J. GIS"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1385","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/34.87344","article-title":"Watersheds in digital spaces: An efficient algorithm based on immersion simulations","volume":"13","author":"Vincent","year":"1991","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1390","article-title":"The Virtual Reality Modeling Language Specification \u2014 Version 2.0","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1395","first-page":"103","article-title":"Accurate triangulations of deformed, intersecting surfaces","volume":"21","author":"Von Herzen","year":"1987"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1400","first-page":"420","article-title":"An efficient and effective approximation algorithm for the map labeling problem","volume":"979","author":"Wagner","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1405","first-page":"109","article-title":"Map labeling heuristics: Provably good and practically useful","author":"Wagner","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1410","series-title":"Spatial Information Theory","first-page":"173","article-title":"A triangulated spatial model for cartographic generalization of areal objects","volume":"988","author":"Ware","year":"1995"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1415","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1093\/comjnl\/24.2.167","article-title":"Computing the n\u2013dimensional Delaunay tessellation with application to Voronoi polytopes","volume":"24","author":"Watson","year":"1981","journal-title":"The Comput. J."},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1420","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0734-189X(85)90116-1","article-title":"Topographic classification of digital image intensity surfaces using generalized splines and the discrete cosine transformation","volume":"29","author":"Watson","year":"1985","journal-title":"Comput. Vision, Graphics and Image Process"},{"key":"10.1016\/B978-044482537-7\/50008-5_rf1410","series-title":"Terrain Modelling in Survey and Civil Engineering","article-title":"Creation of digital terrain models using analytical photogrammetry and their use in civil engineering","author":"Webb","year":"1990"},{"issue":"1","key":"10.1016\/B978-044482537-7\/50008-5_bb1430","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MCG.1985.276271","article-title":"Edge\u2013based data structures for solid modeling in a curved\u2013surface environment","volume":"5","author":"Weiler","year":"1985","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1435","first-page":"219","article-title":"A framework for digital terrain modeling","author":"Weibel","year":"1990"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1440","article-title":"A typology of constraints for line simplification","author":"Weibel","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1445","series-title":"The Inventor Mentor: Programming Object\u2013Oriented 3D Graphics with Open Inventor","author":"Wemecke","year":"1994"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1450","first-page":"844","article-title":"Metric surface networks","author":"Wolf","year":"1990"},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb1455","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/MCG.1985.276337","article-title":"A combinatorial analysis of boundary data structure schemata","volume":"5","author":"Woo","year":"1985","journal-title":"IEEE Comput. Graphics Appl."},{"issue":"5","key":"10.1016\/B978-044482537-7\/50008-5_bb1460","first-page":"353","article-title":"A generic model for planar geographic objects","volume":"6","author":"Worboys","year":"1992","journal-title":"Internat. J. Geogr. Inform. Systems"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1465","series-title":"Advances in Spatial Database (SSD93)","first-page":"36","article-title":"A canonical model for a class of areal spatial objects","author":"Worboys","year":"1993"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1470","doi-asserted-by":"crossref","DOI":"10.1109\/VISUAL.1996.568126","article-title":"Dynamic view\u2013dependent simplification for polygonal models","author":"Xia","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1475","article-title":"Drainage queries in TINs: From local to global and back again","author":"Yu","year":"1996"},{"key":"10.1016\/B978-044482537-7\/50008-5_bb1480","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0925-7721(96)00009-0","article-title":"Computing the shortest watchlower of a polyhedral terrain in O(n log n) time","volume":"8","author":"Zhu","year":"1997","journal-title":"Comput. Geom."},{"issue":"3","key":"10.1016\/B978-044482537-7\/50008-5_bb1485","doi-asserted-by":"crossref","first-page":"16","DOI":"10.3138\/9258-63QL-3988-110H","article-title":"Integer programming applied to the map label placement problem","volume":"22","author":"Zoraster","year":"1986","journal-title":"Cartographica"}],"container-title":["Handbook of Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444825377500085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444825377500085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T12:05:57Z","timestamp":1587902757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444825377500085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9780444825377"],"references-count":296,"URL":"https:\/\/doi.org\/10.1016\/b978-044482537-7\/50008-5","relation":{},"subject":[],"published":{"date-parts":[[2000]]}}}