{"id":"https://openalex.org/W2114968084","doi":"https://doi.org/10.1145/2093973.2094010","title":"Delineating imprecise regions via shortest-path graphs","display_name":"Delineating imprecise regions via shortest-path graphs","publication_year":2011,"publication_date":"2011-11-01","ids":{"openalex":"https://openalex.org/W2114968084","doi":"https://doi.org/10.1145/2093973.2094010","mag":"2114968084"},"language":"en","primary_location":{"id":"doi:10.1145/2093973.2094010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2093973.2094010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/39baacf0-57df-470e-9f32-78f6d8e1c4c1","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028410825","display_name":"Mark de Berg","orcid":"https://orcid.org/0000-0001-5770-3784"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mark de Berg","raw_affiliation_strings":["TU Eindhoven, The Netherlands","TU Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062614232","display_name":"Wouter Meulemans","orcid":"https://orcid.org/0000-0002-4978-3400"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Wouter Meulemans","raw_affiliation_strings":["TU Eindhoven, The Netherlands","TU Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000420564","display_name":"Bettina Speckmann","orcid":"https://orcid.org/0000-0002-8514-7858"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bettina Speckmann","raw_affiliation_strings":["TU Eindhoven, The Netherlands","TU Eindhoven, the Netherlands"],"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028410825"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.9187,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.74841972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"271","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7256425619125366},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.6678965091705322},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5800498723983765},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5243116617202759},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.514789342880249},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5077084302902222},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4484878480434418},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4349030554294586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3772260546684265},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3529515266418457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31077733635902405},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3041090965270996},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.1848834753036499},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13526222109794617}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7256425619125366},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.6678965091705322},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5800498723983765},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5243116617202759},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.514789342880249},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5077084302902222},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4484878480434418},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4349030554294586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3772260546684265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3529515266418457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31077733635902405},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3041090965270996},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.1848834753036499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13526222109794617},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2093973.2094010","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2093973.2094010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire/39baacf0-57df-470e-9f32-78f6d8e1c4c1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/39baacf0-57df-470e-9f32-78f6d8e1c4c1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M T, Meulemans, W & Speckmann, B 2011, Delineating imprecise regions via shortest-path graphs. in 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM GIS). Association for Computing Machinery, Inc., New York NY, pp. 271-280, 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2011) , Chicago, Illinois, United States, 1/11/11. https://doi.org/10.1145/2093973.2094010","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/39baacf0-57df-470e-9f32-78f6d8e1c4c1","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/39baacf0-57df-470e-9f32-78f6d8e1c4c1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM GIS), 271 - 280","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/39baacf0-57df-470e-9f32-78f6d8e1c4c1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/39baacf0-57df-470e-9f32-78f6d8e1c4c1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Berg, de, M T, Meulemans, W & Speckmann, B 2011, Delineating imprecise regions via shortest-path graphs. in 19th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM GIS). Association for Computing Machinery, Inc., New York NY, pp. 271-280, 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM SIGSPATIAL GIS 2011) , Chicago, Illinois, United States, 1/11/11. https://doi.org/10.1145/2093973.2094010","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.6100000143051147,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[{"id":"https://openalex.org/G258765838","display_name":null,"funder_award_id":"639.022.707","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W176551404","https://openalex.org/W1601919219","https://openalex.org/W1604071614","https://openalex.org/W1966950432","https://openalex.org/W1970754929","https://openalex.org/W2002298914","https://openalex.org/W2002827932","https://openalex.org/W2012867990","https://openalex.org/W2048084489","https://openalex.org/W2050289388","https://openalex.org/W2058510050","https://openalex.org/W2063616871","https://openalex.org/W2076372637","https://openalex.org/W2078443814","https://openalex.org/W2081183584","https://openalex.org/W2085849292","https://openalex.org/W2110770130","https://openalex.org/W2128019210","https://openalex.org/W2141170429","https://openalex.org/W2144324433","https://openalex.org/W2164799852","https://openalex.org/W2913657960","https://openalex.org/W3096230591","https://openalex.org/W4241422031","https://openalex.org/W4285719527","https://openalex.org/W6669884786","https://openalex.org/W6759259885","https://openalex.org/W7037754794"],"related_works":["https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2375775343","https://openalex.org/W1985676638","https://openalex.org/W3032870653","https://openalex.org/W2068319819","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2003715806"],"abstract_inverted_index":{"An":[0],"imprecise":[1,24,127],"region,":[2,7],"also":[3,147],"called":[4],"a":[5,9,12,19,27,79],"vernacular":[6],"is":[8],"region":[10,54],"without":[11,117],"precise":[13],"or":[14,116],"administrative":[15],"boundary.":[16],"We":[17,39,107,120],"present":[18,108],"new":[20],"method":[21],"to":[22,34,61,74,82,86,95,111,138,150],"delineate":[23],"regions":[25,128],"from":[26],"set":[28],"of":[29,53,64,125],"points":[30,85],"that":[31],"are":[32,69],"likely":[33],"lie":[35],"inside":[36],"the":[37,45,51,123,126,142],"region.":[38],"use":[40,78],"shortest-path":[41,89,113],"graphs":[42,58,90,114],"based":[43],"on":[44],"squared":[46],"Euclidean":[47],"distance":[48],"which":[49,84],"capture":[50],"shape":[52],"boundaries":[55],"well.":[56],"Shortest-path":[57],"naturally":[59],"adapt":[60],"point":[62],"sets":[63],"varying":[65],"density,":[66],"and":[67],"they":[68,77],"always":[70],"connected.":[71],"As":[72],"opposed":[73],"neighborhood":[75],"graphs,":[76],"non-local":[80],"criterion":[81],"determine":[83],"connect.":[87],"Furthermore,":[88],"can":[91],"easily":[92],"be":[93],"extended":[94],"take":[96],"geographic":[97,118],"context":[98,103,152],"into":[99,153],"account":[100],"by":[101,141,155],"modeling":[102],"as":[104],"\"soft\"":[105],"obstacles.":[106,159],"efficient":[109],"algorithms":[110],"compute":[112],"with":[115,130],"context.":[119],"experimentally":[121],"evaluate":[122],"quality":[124],"computed":[129],"our":[131,136],"method.":[132],"To":[133],"fairly":[134],"compare":[135],"results":[137],"those":[139],"obtained":[140],"common":[143],"KDE":[144,154],"approach,":[145],"we":[146],"show":[148],"how":[149],"integrate":[151],"again":[156],"using":[157],"soft":[158]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}