{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:16:44Z","timestamp":1740122204370,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T00:00:00Z","timestamp":1594684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000105","name":"Office of Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["1844565"],"award-info":[{"award-number":["1844565"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s10707-020-00416-9","type":"journal-article","created":{"date-parts":[[2020,7,14]],"date-time":"2020-07-14T21:02:39Z","timestamp":1594760559000},"page":"43-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Size constrained k simple polygons"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4293-9908","authenticated-orcid":false,"given":"KwangSoo","family":"Yang","sequence":"first","affiliation":[]},{"given":"Kwang Woo","family":"Nam","sequence":"additional","affiliation":[]},{"given":"Ahmad","family":"Qutbuddin","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Reich","sequence":"additional","affiliation":[]},{"given":"Valmer","family":"Huhn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,14]]},"reference":[{"issue":"1","key":"416_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/PL00009204","volume":"21","author":"EM Arkin","year":"1998","unstructured":"Arkin EM, Chiang YJ, Held M, Mitchell JSB, Sacristan V, Skiena S, Yang TC (1998) On minimum-area hulls. Algorithmica 21(1):119\u2013136","journal-title":"Algorithmica"},{"key":"416_CR2","doi-asserted-by":"crossref","unstructured":"Bereg S, Daescu O, Zivanic M, Rozario T (2015) Smallest maximum-weight circle for weighted points in the plane. In: International conference on computational science and its applications. Springer, pp 244\u2013253","DOI":"10.1007\/978-3-319-21407-8_19"},{"issue":"6","key":"416_CR3","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1080\/00029890.2005.11920227","volume":"112","author":"V Bl\u00e5sj\u00f6","year":"2005","unstructured":"Bl\u00e5sj\u00f6 V (2005) The isoperimetric problem. Am Math Mon 112 (6):526\u2013566","journal-title":"Am Math Mon"},{"key":"416_CR4","doi-asserted-by":"crossref","unstructured":"Boyce JE, Dobkin DP, Drysdale RLS III, Guibas LJ (1982) Finding extremal polygons. In: Proceedings of the fourteenth annual ACM symposium on theory of computing. ACM, pp 282\u2013289","DOI":"10.1145\/800070.802202"},{"issue":"4","key":"416_CR5","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1080\/07468342.1986.11972974","volume":"17","author":"B Braden","year":"1986","unstructured":"Braden B (1986) The surveyor\u2019s area formula. Coll Math J 17 (4):326\u2013337","journal-title":"Coll Math J"},{"key":"416_CR6","unstructured":"Bradley P, Bennett K, Demiriz A (2000) Constrained k-means clustering. Microsoft research, Redmond, pp 1\u20138"},{"key":"416_CR7","unstructured":"City of Chicago Data Potal (2019) Crimes\u20142001 to present, https:\/\/data.cityofchicago.org\/Public-Safety\/Crimes-2001-to-present\/ijzp-q8t2. Retrieved Feb. 2019"},{"key":"416_CR8","unstructured":"Coxeter HSM (1989) Introduction to geometry. John Wiley & Sons"},{"key":"416_CR9","doi-asserted-by":"crossref","unstructured":"De Berg M, Cheong O, Van Kreveld M, Overmars M (2008) Computational geometry: introduction. In: Computational geometry: algorithms and applications, pp 1\u201317","DOI":"10.1007\/978-3-662-04245-8_1"},{"key":"416_CR10","volume-title":"Discrete and computational geometry","author":"SL Devadoss","year":"2011","unstructured":"Devadoss SL, O\u2019Rourke J (2011) Discrete and computational geometry. Princeton University Press, Princeton"},{"issue":"1","key":"416_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1287\/mnsc.19.1.96","volume":"19","author":"DJ Elzinga","year":"1972","unstructured":"Elzinga DJ, Hearn DW (1972) The minimum covering sphere problem. Manag Sci 19(1):96\u2013104","journal-title":"Manag Sci"},{"issue":"1","key":"416_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D Eppstein","year":"1992","unstructured":"Eppstein D, Overmars M, Rote G, Woeginger G (1992) Finding minimum areak-gons. Discrete Comput Geom 7(1):45\u201358","journal-title":"Discrete Comput Geom"},{"key":"416_CR13","unstructured":"Ertoz L, Steinbach M, Kumar V (2002) A new shared nearest neighbor clustering algorithm and its applications. In: Workshop on clustering high dimensional data and its applications at 2nd SIAM international conference on data mining, pp 105\u2013115"},{"key":"416_CR14","unstructured":"Ester M, Kriegel HP, Sander J, Xu X et al (1996) A density-based algorithm for discovering clusters in large spatial databases with noise. In: Kdd, vol 96, pp 226\u2013231"},{"key":"416_CR15","unstructured":"Federal Wildland Fire Occurrence Data, https:\/\/wildfire.cr.usgs.gov\/firehistory\/data.html\/, Retrieved Feb. 2019"},{"issue":"1","key":"416_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/PL00009492","volume":"23","author":"SP Fekete","year":"2000","unstructured":"Fekete SP (2000) On simple polygonalizations with optimal area. Discrete Comput Geom 23(1):73\u2013110","journal-title":"Discrete Comput Geom"},{"key":"416_CR17","doi-asserted-by":"crossref","unstructured":"Fekete SP, Pulleyblank WR (1993) Area optimization of simple polygons. In: Proceedings of the ninth annual symposium on computational geometry, pp 173\u2013182","DOI":"10.1145\/160985.161016"},{"issue":"6","key":"416_CR18","doi-asserted-by":"publisher","first-page":"1741","DOI":"10.1007\/s00373-012-1221-8","volume":"29","author":"R Fulek","year":"2013","unstructured":"Fulek R, Keszegh B, Mori\u0107 F, Uljarevi\u0107 I (2013) On polygons excluding point sets. Graphs Comb 29(6):1741\u20131753","journal-title":"Graphs Comb"},{"issue":"4","key":"416_CR19","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1287\/opre.30.4.777","volume":"30","author":"DW Hearn","year":"1982","unstructured":"Hearn DW, Vijay J (1982) Efficient algorithms for the (weighted) minimum circle problem. Oper Res 30(4):777\u2013795","journal-title":"Oper Res"},{"issue":"5","key":"416_CR20","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0167-6377(97)00051-5","volume":"21","author":"JF H\u00eache","year":"1997","unstructured":"H\u00eache J F, Liebling TM (1997) Finding minimum area simple pentagons. Oper Res Lett 21(5):229\u2013233","journal-title":"Oper Res Lett"},{"key":"416_CR21","doi-asserted-by":"crossref","unstructured":"Hinneburg A, Gabriel HH (2007) Denclue 2.0: fast clustering based on kernel density estimation. In: International symposium on intelligent data analysis. Springer, pp 70\u201380","DOI":"10.1007\/978-3-540-74825-0_7"},{"key":"416_CR22","doi-asserted-by":"crossref","unstructured":"Jiang M (2012) On covering points with minimum turns. In: Frontiers in algorithmics and algorithmic aspects in information and management. Springer, pp 58\u201369","DOI":"10.1007\/978-3-642-29700-7_6"},{"issue":"8","key":"416_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G Karypis","year":"1999","unstructured":"Karypis G, Han EH, Kumar V (1999) Chameleon: hierarchical clustering using dynamic modeling. Computer 32(8):68\u201375","journal-title":"Computer"},{"key":"416_CR24","doi-asserted-by":"crossref","unstructured":"Li X, Han J, Lee JG, Gonzalez H (2007) Traffic density-based discovery of hot routes in road networks. In: International symposium on spatial and temporal databases. Springer, pp 441\u2013459","DOI":"10.1007\/978-3-540-73540-3_25"},{"key":"416_CR25","doi-asserted-by":"crossref","unstructured":"Malinen MI, Fr\u00e4nti P (2014) Balanced k-means for clustering. In: Joint IAPR international workshops on statistical techniques in pattern recognition (SPR) and structural and syntactic pattern recognition (SSPR). Springer, pp 32\u201341","DOI":"10.1007\/978-3-662-44415-3_4"},{"issue":"3-4","key":"416_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ipl.2008.02.007","volume":"107","author":"JS Mitchell","year":"2008","unstructured":"Mitchell JS, Polishchuk V (2008) Minimum-perimeter enclosures. Inf Process Lett 107(3-4):120\u2013124","journal-title":"Inf Process Lett"},{"key":"416_CR27","volume-title":"Topology","author":"JR Munkres","year":"2000","unstructured":"Munkres JR (2000) Topology. Prentice Hall, Upper Saddle River"},{"key":"416_CR28","doi-asserted-by":"crossref","unstructured":"Muravitskiy V, Tereshchenko V (2011) Generating a simple polygonalizations. In: 2011 15th international conference on information visualisation (IV). IEEE, pp 502\u2013506","DOI":"10.1109\/IV.2011.88"},{"issue":"6","key":"416_CR29","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1109\/TKDE.2013.135","volume":"26","author":"D Oliver","year":"2014","unstructured":"Oliver D, Shekhar S, Kang JM, Laubscher R, Carlan V, Bannur A (2014) A k-main routes approach to spatial network activity summarization. IEEE Trans Knowl Data Eng 26(6):1464\u20131478","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"416_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2896849","volume":"21","author":"J Peethambaran","year":"2016","unstructured":"Peethambaran J, Parakkat AD, Muthuganapathy R (2016) An empirical study on randomized optimal area polygonization of planar point sets. J Exp Algorithmics (JEA) 21:1\u201310","journal-title":"J Exp Algorithmics (JEA)"},{"key":"416_CR31","doi-asserted-by":"crossref","unstructured":"Reich A, Ohriniuc R, Yang K (2018) Size constrained k simple polygons. In: Proceedings of the 26th ACM SIGSPATIAL international conference on advances in geographic information systems. ACM, pp 500\u2013503","DOI":"10.1145\/3274895.3274962"},{"key":"416_CR32","unstructured":"Samet H (2006) Foundations of multidimensional and metric data structures. Morgan Kaufmann"},{"key":"416_CR33","unstructured":"Taranilla MT, Gagliardi EO, Hern\u00e1ndez Pe\u00f1alver G (2011) Approaching minimum area polygonization. In: XVII Congreso Argentino de Ciencias de la Computaci\u00f3n"},{"key":"416_CR34","unstructured":"Wang W, Yang J, Muntz R, et al. (1997) Sting: a statistical information grid approach to spatial data mining. In: VLDB, vol 97, pp 186\u2013195"},{"key":"416_CR35","doi-asserted-by":"crossref","unstructured":"Xu X, Yuruk N, Feng Z, Schweiger TA (2007) Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 824\u2013833","DOI":"10.1145\/1281192.1281280"},{"key":"416_CR36","doi-asserted-by":"crossref","unstructured":"Yang K (2016) Distance-constrained k spatial sub-networks: a summary of results International conference on geographic information science. Springer, pp 68\u201384","DOI":"10.1007\/978-3-319-45738-3_5"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00416-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-020-00416-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-020-00416-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T00:00:49Z","timestamp":1626220849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-020-00416-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,14]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["416"],"URL":"https:\/\/doi.org\/10.1007\/s10707-020-00416-9","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2020,7,14]]},"assertion":[{"value":"5 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 June 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}