{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:42Z","timestamp":1725579042985},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_36","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"363-376","source":"Crossref","is-referenced-by-count":0,"title":["Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems. Information Processing Letters\u00a08, 244\u2013251 (1979)","journal-title":"Information Processing Letters"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02189314","volume":"9","author":"B. Chazelle","year":"1993","unstructured":"Chazelle, B.: Cutting hyperplanes for divide-and-conquer. Discrete & Computational Geometry\u00a09(2), 145\u2013158 (1993)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B. Chazelle","year":"1999","unstructured":"Chazelle, B.: Lower bounds on the complexity of polytope range searching. J. Amer. Math. Soc.\u00a02(4), 637\u2013666 (1999)","journal-title":"J. Amer. Math. Soc."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Sharir, M., Welzl, E.: Quasi-optimal upper bounds for simplex range searching and new zone theorems. In: Proc. of the 6th ACM Symposium on Computational Geometry, pp. 23\u201333 (1990)","DOI":"10.1145\/98524.98532"},{"issue":"5","key":"36_CR5","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02187743","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Welzl, E.: Quasi-optimal range searching in spaces of finite vc-dimension. Discrete & Computational Geometry\u00a04(5), 467\u2013489 (1989)","journal-title":"Discrete & Computational Geometry"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-10631-6_24","volume-title":"Algorithms and Computation","author":"D.Z. Chen","year":"2009","unstructured":"Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function: I. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 224\u2013233. Springer, Heidelberg (2009)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-10631-6_25","volume-title":"Algorithms and Computation","author":"D.Z. Chen","year":"2009","unstructured":"Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function: II. Dealing with outliers. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 234\u2013243. Springer, Heidelberg (2009)"},{"key":"36_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry \u2013 Algorithms and Applications","author":"M. Berg de","year":"1997","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry \u2013 Algorithms and Applications, 1st edn. Springer, Berlin (1997)","edition":"1"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: Proc. of the 13th International Conference on Knowledge Discovery and Data Mining, pp. 380\u2013389 (2007)","DOI":"10.1145\/1281192.1281235"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J.: Efficient partition trees. Discrete and Computational Geometry\u00a08(3), 315\u2013334 (1992)","journal-title":"Discrete and Computational Geometry"},{"issue":"1","key":"36_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discrete & Computational Geometry\u00a010(1), 157\u2013182 (1993)","journal-title":"Discrete & Computational Geometry"},{"key":"36_CR12","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J. O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. of ACM\u00a024, 574\u2013578 (1981)","journal-title":"Commun. of ACM"},{"key":"36_CR13","volume-title":"The design of dynamic data structures","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The design of dynamic data structures. Springer, Berlin (1983)"},{"key":"36_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0211012","volume":"11","author":"D.E. Willard","year":"1982","unstructured":"Willard, D.E.: Polygon retrieval. SIAM Journal on Computing\u00a011, 149\u2013165 (1982)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T08:46:23Z","timestamp":1592383583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}