{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T15:39:56Z","timestamp":1784821196705,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,5]],"date-time":"2011-08-05T00:00:00Z","timestamp":1312502400000},"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":[[2011,8,5]]},"DOI":"10.1145\/2018323.2018345","type":"proceedings-article","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T16:16:32Z","timestamp":1312992992000},"page":"135-142","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":70,"title":["Farthest-point optimized point sets with maximized minimum distance"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Schl\u00f6mer","sequence":"first","affiliation":[{"name":"University of Konstanz"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Heck","sequence":"additional","affiliation":[{"name":"University of Konstanz"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oliver","family":"Deussen","sequence":"additional","affiliation":[{"name":"University of Konstanz"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,8,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/97879.97886"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531392"},{"key":"e_1_3_2_1_3_1","unstructured":"Cgal Computational Geometry Algorithms Library. http:\/\/www.cgal.org.  Cgal Computational Geometry Algorithms Library. http:\/\/www.cgal.org."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/7529.8927"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195902000815"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.02.002"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144599352836"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141915"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/83.623193"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-004-1089-3"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640443.1640451"},{"key":"e_1_3_2_1_12_1","first-page":"395","article-title":"(t, m, s)-nets and maximized minimum distance, part II","volume":"2008","author":"Gr\u00fcnschloss L.","year":"2009","unstructured":"Gr\u00fcnschloss , L. , and Keller , A. 2009 . (t, m, s)-nets and maximized minimum distance, part II . Monte Carlo and Quasi-Monte Carlo Methods 2008 , 395 -- 409 . Gr\u00fcnschloss, L., and Keller, A. 2009. (t, m, s)-nets and maximized minimum distance, part II. Monte Carlo and Quasi-Monte Carlo Methods 2008, 395--409.","journal-title":"Monte Carlo and Quasi-Monte Carlo Methods"},{"key":"e_1_3_2_1_13_1","first-page":"210","article-title":"Deterministic blue noise sampling by solving largest empty circle problems","volume":"40","author":"Kanamori Y.","year":"2011","unstructured":"Kanamori , Y. , Szego , Z. , and Nishita , T. 2011 . Deterministic blue noise sampling by solving largest empty circle problems . Journal of IIEEJ 40 , 210 . Kanamori, Y., Szego, Z., and Nishita, T. 2011. Deterministic blue noise sampling by solving largest empty circle problems. Journal of IIEEJ 40, 210.","journal-title":"Journal of IIEEJ"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2007.01100.x"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/122718.122736"},{"key":"e_1_3_2_1_17_1","volume-title":"Tech. Rep. UCAM-CL-TR-562","author":"Moenning C.","year":"2003","unstructured":"Moenning , C. , and Dodgson , N. A . 2003 . Fast marching farthest point sampling. Tech. Rep. UCAM-CL-TR-562 , University of Cambridge Computer Laboratory , Apr. Moenning, C., and Dodgson, N. A. 2003. Fast marching farthest point sampling. Tech. Rep. UCAM-CL-TR-562, University of Cambridge Computer Laboratory, Apr."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-006-6859-3"},{"key":"e_1_3_2_1_19_1","unstructured":"Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation 2nd ed. Morgan Kaufmann Publishers Inc.   Pharr M. and Humphreys G. 2010. Physically Based Rendering Second Edition: From Theory To Implementation 2nd ed. Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2010.01716.x"},{"key":"e_1_3_2_1_21_1","first-page":"784","article-title":"On the distribution of points in a cube and the approximate evaluation of integrals. Zh. vychisl. Mat. mat","volume":"7","author":"Sobol I.","year":"1967","unstructured":"Sobol , I. 1967 . On the distribution of points in a cube and the approximate evaluation of integrals. Zh. vychisl. Mat. mat . Fiz. 7 , 4, 784 -- 802 . Sobol, I. 1967. On the distribution of points in a cube and the approximate evaluation of integrals. Zh. vychisl. Mat. mat. Fiz. 7, 4, 784--802.","journal-title":"Fiz."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19510050310"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.3288"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360619"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778816"}],"event":{"name":"HPG '11: High Performance Graphics","location":"Vancouver British Columbia Canada","acronym":"HPG '11","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","EUROGRAPHICS The European Association for Computer Graphics"]},"container-title":["Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018323.2018345","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2018323.2018345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:00:04Z","timestamp":1750244404000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2018323.2018345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,5]]},"references-count":25,"alternative-id":["10.1145\/2018323.2018345","10.1145\/2018323"],"URL":"https:\/\/doi.org\/10.1145\/2018323.2018345","relation":{},"subject":[],"published":{"date-parts":[[2011,8,5]]},"assertion":[{"value":"2011-08-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}