{"id":"https://openalex.org/W2007813371","doi":"https://doi.org/10.1145/1989323.1989369","title":"Finding shortest path on land surface","display_name":"Finding shortest path on land surface","publication_year":2011,"publication_date":"2011-06-12","ids":{"openalex":"https://openalex.org/W2007813371","doi":"https://doi.org/10.1145/1989323.1989369","mag":"2007813371"},"language":"en","primary_location":{"id":"doi:10.1145/1989323.1989369","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016942579","display_name":"Liu Lian","orcid":"https://orcid.org/0000-0001-7640-3226"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Lian Liu","raw_affiliation_strings":["The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049858061","display_name":"Raymond Chi-Wing Wong","orcid":"https://orcid.org/0000-0001-7045-6503"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Raymond Chi-Wing Wong","raw_affiliation_strings":["The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016942579"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":2.4498,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89287378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"433","last_page":"444"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10757","display_name":"Geographic Information Systems Studies","score":0.9937999844551086,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.809920608997345},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7855298519134521},{"id":"https://openalex.org/keywords/terrain","display_name":"Terrain","score":0.7702707648277283},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6817969083786011},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5583582520484924},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.5545010566711426},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4931642413139343},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.47830039262771606},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42090827226638794},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.41399556398391724},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4133774936199188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37391066551208496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37066444754600525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22503617405891418},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.08654633164405823},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0834181010723114}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.809920608997345},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7855298519134521},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.7702707648277283},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6817969083786011},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5583582520484924},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.5545010566711426},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4931642413139343},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.47830039262771606},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42090827226638794},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.41399556398391724},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4133774936199188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37391066551208496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37066444754600525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22503617405891418},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.08654633164405823},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0834181010723114},{"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/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1989323.1989369","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989323.1989369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-8171","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-8171","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1014505","https://openalex.org/W1497953515","https://openalex.org/W1499588015","https://openalex.org/W1561797603","https://openalex.org/W1704188637","https://openalex.org/W1968338679","https://openalex.org/W2021587133","https://openalex.org/W2039759479","https://openalex.org/W2043896016","https://openalex.org/W2070164574","https://openalex.org/W2072019354","https://openalex.org/W2072410861","https://openalex.org/W2094360223","https://openalex.org/W2101229914","https://openalex.org/W2108567935","https://openalex.org/W2114427728","https://openalex.org/W2117961179","https://openalex.org/W2137101044","https://openalex.org/W2149906774","https://openalex.org/W2158427612","https://openalex.org/W2162703138","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2171901130","https://openalex.org/W2235901111","https://openalex.org/W2295216480","https://openalex.org/W2494779131","https://openalex.org/W4230163235","https://openalex.org/W4251391716","https://openalex.org/W4256238177","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2156431668","https://openalex.org/W2198982833","https://openalex.org/W2347245430","https://openalex.org/W2375775343","https://openalex.org/W2161960576","https://openalex.org/W4293054712","https://openalex.org/W2112429204","https://openalex.org/W2365712669","https://openalex.org/W2562562750"],"abstract_inverted_index":{"Finding":[0],"shortest":[1,71,93,102,123,143],"paths":[2,72,94,103,124,144],"is":[3,84,108,135,149,160],"a":[4,15,40,54,67,112],"fundamental":[5],"operator":[6],"in":[7,32,39,59],"spatial":[8],"databases.":[9],"Recently,":[10],"terrain":[11,33,60],"datasets":[12,34],"have":[13],"attracted":[14],"lot":[16],"of":[17,50,69,91,141],"attention":[18],"from":[19],"both":[20],"industry":[21],"and":[22,163],"academia.":[23],"There":[24],"are":[25],"some":[26],"interesting":[27],"issues":[28,52],"to":[29,154],"be":[30,37],"studied":[31],"which":[35,57],"cannot":[36],"found":[38],"traditional":[41,89,178],"two-dimensional":[42],"space.":[43],"In":[44,62],"this":[45,63,81,131,146],"paper,":[46,64],"we":[47,65,78,110,120],"study":[48],"one":[49],"the":[51,74,88,97,105,126,133,139,157,168,172,177,181],"called":[53,115],"slope":[55,75,98,106,127,173,182],"constraint":[56,107,128,174],"exists":[58],"datasets.":[61],"propose":[66,111],"problem":[68,83,90,170,179],"finding":[70,92,101,142],"with":[73,104,125,171],"constraint.":[76,99,183],"Then,":[77],"show":[79,155],"that":[80,119,138,156],"new":[82,113,169],"more":[85],"general":[86],"than":[87],"without":[95,180],"considering":[96],"Since":[100],"costly,":[109],"framework":[114],"surface":[116,134,148,158],"simplification":[117,159],"so":[118],"can":[121],"compute":[122],"efficiently.":[129],"Under":[130],"framework,":[132],"\"simplified\"":[136],"such":[137],"complexity":[140],"on":[145],"simplified":[147],"lower.":[150],"We":[151],"conducted":[152],"experiments":[153],"very":[161],"efficient":[162],"effective":[164],"not":[165],"only":[166],"for":[167],"but":[175],"also":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}