{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:09Z","timestamp":1725701649275},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_10","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"96-107","source":"Crossref","is-referenced-by-count":4,"title":["Simplifying Massive Contour Maps"],"prefix":"10.1007","author":[{"given":"Lars","family":"Arge","sequence":"first","affiliation":[]},{"given":"Lasse","family":"Deleuran","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"M\u00f8lhave","sequence":"additional","affiliation":[]},{"given":"Morten","family":"Revsb\u00e6k","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Truelsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"TPIE - Templated Portable I\/O-Environment, \n                  \n                    http:\/\/madalgo.au.dk\/tpie"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Arge, L., M\u00f8lhave, T., Sadri, B.: I\/O-efficient algorithms for computing contours on a terrain. In: Proc. Symposium on Computational Geometry, pp. 129\u2013138 (2008)","DOI":"10.1145\/1377676.1377698"},{"key":"10_CR3","unstructured":"Agarwal, P.K., Arge, L., Murali, T.M., Varadarajan, K., Vitter, J.S.: I\/O-efficient algorithms for contour line extraction and planar graph blocking. In: Proc. ACM-SIAM Symposium on Discrete Algorithms, pp. 117\u2013126 (1998)"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1868237.1868249","volume":"7","author":"P.K. Agarwal","year":"2010","unstructured":"Agarwal, P.K., Arge, L., Yi, K.: I\/O-efficient batched union-find and its applications to terrain analysis. ACM Trans. Algorithms\u00a07(1), 11:1\u201311:21 (2010)","journal-title":"ACM Trans. Algorithms"},{"issue":"9","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, S., Jeffrey: The input\/output complexity of sorting and related problems. Commun. ACM\u00a031(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Arge, L.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313\u2013358 (2002)","DOI":"10.1007\/978-1-4615-0005-6_9"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Arge, L., Larsen, K., M\u00f8lhave, T., van Walderveen, F.: Cleaning massive sonar point clouds. In: Proc ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, pp. 152\u2013161 (2010)","DOI":"10.1145\/1869790.1869815"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Cabello, S., Liu, Y., Mantler, A., Snoeyink, J.: Testing homotopy for paths in the plane. In: Proc. Symposium on Computational Geometry, pp. 160\u2013169 (2002)","DOI":"10.1145\/513400.513421"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Carr, H., Snoeyink, J., van de Panne, M.: Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. In: Computational Geometry, pp. 42\u201358 (2010) (Special Issue on the 14th Annual Fall Workshop)","DOI":"10.1016\/j.comgeo.2006.05.009"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Danner, A., M\u00f8lhave, T., Yi, K., Agarwal, P., Arge, L., Mitasova, H.: TerraStream: From elevation data to watershed hierarchies. In: Proc. ACM International Symposium on Advances in Geographic Information Systems, pp. 28:1\u201328:8 (2007)","DOI":"10.1145\/1341012.1341049"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry \u2013 Algorithms and Applications (1997)","DOI":"10.1007\/978-3-662-03427-9"},{"key":"10_CR12","unstructured":"de Berg, M., van Kreveld, M., Schirra, S.: A new approach to subdivision simplification. In: Proc. 12th Internat. Sympos. Comput.-Assist. Cartog., pp. 79\u201388 (1995)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Douglas, D., Peucker, T.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature (1973)","DOI":"10.3138\/FM57-6770-U75U-7727"},{"key":"10_CR14","unstructured":"Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. In: Proc. IEEE Symposium on Foundations of Computer Science, pp. 454\u2013463 (2000)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Garland, M., Heckbert, P.: Surface simplification using quadric error metrics. In: Proc. Computer Graphics and Interactive Techniques, pp. 209\u2013216 (1997)","DOI":"10.1145\/258734.258849"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"10_CR17","unstructured":"Heckbert, P.S., Garland, M.: Survey of polygonal surface simplification algorithms. Technical report, CS Dept., Carnegie Mellon U (to appear)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl, 63\u201397 (1994)","DOI":"10.1016\/0925-7721(94)90010-8"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Saalfeld, A.: Topologically consistent line simplification with the douglas peucker algorithm. In: Geographic Information Science (1999)","DOI":"10.1559\/152304099782424901"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Vitter, J.: External memory algorithms and data structures: Dealing with MASSIVE data. ACM Computing Surveys, 209\u2013271 (2001)","DOI":"10.1145\/384192.384193"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:43Z","timestamp":1620129283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}