{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:47Z","timestamp":1750308047083,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,6,5]],"date-time":"2006-06-05T00:00:00Z","timestamp":1149465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,6,5]]},"DOI":"10.1145\/1137856.1137912","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"386-394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Online geometric reconstruction"],"prefix":"10.1145","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Seshadhri","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The probabilistic method","author":"Alon N.","year":"2000","unstructured":"Alon , N. , Spencer , J. The probabilistic method , John Wiley , 2 nd edition, 2000 .]] Alon, N., Spencer, J. The probabilistic method, John Wiley, 2nd edition, 2000.]]","edition":"2"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. SODA","author":"Agarwal P.K.","year":"1997","unstructured":"Agarwal , P.K. , Desikan P.K. An efficient algorithm for terrain simplification , Proc. SODA ( 1997 ), 139--147.]] Agarwal, P.K., Desikan P.K. An efficient algorithm for terrain simplification, Proc. SODA (1997), 139--147.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740835"},{"key":"e_1_3_2_1_4_1","unstructured":"Agarwal P.K. Har-Peled S. Mustafa N. Wang Y. Near-linear time approximation algorithms for curve simplification to appear in Algorithmica.]]   Agarwal P.K. Har-Peled S. Mustafa N. Wang Y. Near-linear time approximation algorithms for curve simplification to appear in Algorithmica.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01293483"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794269801"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27821-4_21"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796550"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/336154.336207"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511626371","volume-title":"The Discrepancy Method : Randomness and Complexity","author":"Chazelle B.","year":"2000","unstructured":"Chazelle , B. The Discrepancy Method : Randomness and Complexity , Cambridge University Press , 2000 ; paperback version, 2001.]] Chazelle, B. The Discrepancy Method : Randomness and Complexity, Cambridge University Press, 2000; paperback version, 2001.]]"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780620"},{"key":"e_1_3_2_1_13_1","volume-title":"Congressus Numerantium: 29","author":"Chvatal V.","year":"1980","unstructured":"Chvatal , V. , Klincsek , G. Finding largest convex subsets , Congressus Numerantium: 29 ( 1980 ), 453--460.]] Chvatal, V., Klincsek, G. Finding largest convex subsets, Congressus Numerantium: 29 (1980), 453--460.]]"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. SODA","author":"Czumaj A.","year":"2003","unstructured":"Czumaj , A. , Ergun , F. , Fortnow , L. , Magen , A. , Newman , I. , Rubinfeld , R. , Sohler , C. , Sublinear-time approximation of Euclidean minimum spanning tree , Proc. SODA ( 2003 ), 813--822.]] Czumaj, A., Ergun, F., Fortnow, L., Magen, A., Newman, I., Rubinfeld, R., Sohler, C., Sublinear-time approximation of Euclidean minimum spanning tree, Proc. SODA (2003), 813--822.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740634"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007386"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/647910.740467"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03427-9","volume-title":"Computational Geometry - Algorithms and Applications","author":"de Berg M.","year":"1997","unstructured":"de Berg , M. , van Kreveld , M. , Overmars , O. , Schwarzkopf , O. Computational Geometry - Algorithms and Applications , Springer-Verlag , 1997 .]] de Berg, M., van Kreveld, M., Overmars, O., Schwarzkopf, O. Computational Geometry - Algorithms and Applications, Springer-Verlag, 1997.]]"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276757"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796533"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301366"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0136016"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209046"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/237218.237344"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90030-9"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. SODA","author":"Mishra N.","year":"2001","unstructured":"Mishra , N. , Oblinger , D. , Pitt , L. Sublinear time approximate clustering , Proc. SODA ( 2001 ), 439--447.]] Mishra, N., Oblinger, D., Pitt, L. Sublinear time approximate clustering, Proc. SODA (2001), 439--447.]]"}],"event":{"name":"SoCG06: 22nd Annual Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Sedona Arizona USA","acronym":"SoCG06"},"container-title":["Proceedings of the twenty-second annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1137856.1137912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:14:32Z","timestamp":1750259672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1137856.1137912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,5]]},"references-count":27,"alternative-id":["10.1145\/1137856.1137912","10.1145\/1137856"],"URL":"https:\/\/doi.org\/10.1145\/1137856.1137912","relation":{},"subject":[],"published":{"date-parts":[[2006,6,5]]},"assertion":[{"value":"2006-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}