{"id":"https://openalex.org/W2051788086","doi":"https://doi.org/10.1145/2668064.2668097","title":"Computing high-quality paths in weighted regions","display_name":"Computing high-quality paths in weighted regions","publication_year":2014,"publication_date":"2014-11-06","ids":{"openalex":"https://openalex.org/W2051788086","doi":"https://doi.org/10.1145/2668064.2668097","mag":"2051788086"},"language":"en","primary_location":{"id":"doi:10.1145/2668064.2668097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2668064.2668097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventh International Conference on Motion in Games","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dspace.library.uu.nl/handle/1874/301761","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062608507","display_name":"Norman Jaklin","orcid":null},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Norman Jaklin","raw_affiliation_strings":["Utrecht University","Utrecht university > > > >"],"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university > > > >","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067016964","display_name":"Mark Tibboel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mark Tibboel","raw_affiliation_strings":["Nspyre"],"affiliations":[{"raw_affiliation_string":"Nspyre","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053354361","display_name":"Roland Ger\u00e6rts","orcid":"https://orcid.org/0000-0002-8161-579X"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Roland Geraerts","raw_affiliation_strings":["Utrecht University","Utrecht university > > > >"],"affiliations":[{"raw_affiliation_string":"Utrecht University","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Utrecht university > > > >","institution_ids":["https://openalex.org/I193662353"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062608507"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":null,"apc_paid":null,"fwci":1.2353,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.83469997,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"77","last_page":"86"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9988999962806702,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/grid","display_name":"Grid","score":0.7703301310539246},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.6936555504798889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6847022771835327},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.682461142539978},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.6027306318283081},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5601955652236938},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.5554422736167908},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4893569350242615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4716735780239105},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4365798234939575},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3820968568325043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29896047711372375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.255368709564209},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1732095181941986},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11272212862968445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08099311590194702}],"concepts":[{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.7703301310539246},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.6936555504798889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6847022771835327},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.682461142539978},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.6027306318283081},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5601955652236938},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.5554422736167908},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4893569350242615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4716735780239105},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4365798234939575},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3820968568325043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29896047711372375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.255368709564209},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1732095181941986},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11272212862968445},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08099311590194702},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2668064.2668097","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2668064.2668097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventh International Conference on Motion in Games","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.706.3161","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.706.3161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.staff.science.uu.nl/%7Egerae101/pdf/Computing_High-Quality_Paths_in_Weighted_Regions_MIG2014.pdf","raw_type":"text"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/301761","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/301761","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":"7th International ACM SIGGRAPH Conference on Motion in Games, 77","raw_type":"info:eu-repo/semantics/bookpart"}],"best_oa_location":{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/301761","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/301761","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":"7th International ACM SIGGRAPH Conference on Motion in Games, 77","raw_type":"info:eu-repo/semantics/bookpart"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1514550606","https://openalex.org/W1579058916","https://openalex.org/W1969483458","https://openalex.org/W1989723858","https://openalex.org/W2003708116","https://openalex.org/W2012691739","https://openalex.org/W2028769163","https://openalex.org/W2074682596","https://openalex.org/W2094360223","https://openalex.org/W2140911750","https://openalex.org/W2146052935","https://openalex.org/W2152679156","https://openalex.org/W2169528473","https://openalex.org/W2171330332","https://openalex.org/W2295337288","https://openalex.org/W2295752869","https://openalex.org/W2541589810","https://openalex.org/W4255793954"],"related_works":["https://openalex.org/W4244083562","https://openalex.org/W2296482608","https://openalex.org/W2912813468","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"The":[0],"Weighted":[1],"Region":[2],"Problem":[3],"is":[4,30],"defined":[5],"as":[6,195],"the":[7,28,42,46,69,100,111,128,137,142,149,178],"problem":[8],"of":[9,27,45,68,102,113,151,177],"finding":[10],"a":[11,15,24,106,115,118,159,174],"cost-optimal":[12],"path":[13,75,116],"in":[14,117,127,202],"weighted":[16,121],"planar":[17],"polygonal":[18],"subdivision.":[19],"Searching":[20],"for":[21,92,198],"paths":[22,50,104,169,184],"on":[23,64,105],"grid":[25,37,49],"representation":[26,67],"scene":[29,70,119],"fast":[31],"and":[32,88,191],"easy":[33],"to":[34,77],"implement.":[35],"However,":[36,82],"representations":[38],"do":[39],"not":[40,56,90],"capture":[41],"exact":[43,66],"geometry":[44],"scene.":[47,179],"Hence,":[48],"can":[51,71,123,185],"be":[52,124,186],"inaccurate":[53],"or":[54,206],"might":[55],"even":[57],"exist":[58],"at":[59,145,188],"all.":[60],"Methods":[61],"that":[62,110,141,170,182],"work":[63],"an":[65,73,78,152,196],"approximate":[72],"optimal":[74,103,153],"up":[76],"arbitrarily":[79,125],"small":[80],"\u03b5-error.":[81],"these":[83],"methods":[84],"are":[85,134,144,171,192],"computationally":[86],"inefficient":[87],"thus":[89,193],"well-suited":[91,194],"real-time":[93],"applications.":[94,208],"In":[95,155],"this":[96],"paper,":[97],"we":[98,139,157],"analyze":[99],"quality":[101],"8-neighbor-grid.":[107],"We":[108],"prove":[109,140],"costs":[112,143,150],"such":[114],"with":[120,136],"regions":[122,133],"high":[126],"general":[129],"case.":[130],"If":[131],"all":[132],"aligned":[135],"grid,":[138],"most":[146],"(4+[EQUATION])":[147],"times":[148],"path.":[154],"addition,":[156],"present":[158],"new":[160],"hybrid":[161],"method":[162],"called":[163],"Vertex-based":[164],"Pruning":[165],"(VBP).":[166],"VBP":[167,183],"computes":[168],"\u03b5-optimal":[172],"inside":[173],"pruned":[175],"subset":[176],"Experiments":[180],"show":[181],"computed":[187],"interactive":[189],"rates,":[190],"input":[197],"advanced":[199],"path-following":[200],"strategies":[201],"robotics,":[203],"crowd":[204],"simulation":[205],"gaming":[207]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}