{"id":"https://openalex.org/W4390695045","doi":"https://doi.org/10.3390/a17010029","title":"Navigating the Maps: Euclidean vs. Road Network Distances in Spatial Queries","display_name":"Navigating the Maps: Euclidean vs. Road Network Distances in Spatial Queries","publication_year":2024,"publication_date":"2024-01-10","ids":{"openalex":"https://openalex.org/W4390695045","doi":"https://doi.org/10.3390/a17010029"},"language":"en","primary_location":{"id":"doi:10.3390/a17010029","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17010029","pdf_url":"https://www.mdpi.com/1999-4893/17/1/29/pdf?version=1704885649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/17/1/29/pdf?version=1704885649","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5093697440","display_name":"Pornrawee Tatit","orcid":null},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Pornrawee Tatit","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Melbourne, VIC 3800, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, VIC 3800, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056087010","display_name":"Kiki Adhinugraha","orcid":"https://orcid.org/0000-0001-5884-1409"},"institutions":[{"id":"https://openalex.org/I196829312","display_name":"La Trobe University","ror":"https://ror.org/01rxfrp27","country_code":"AU","type":"education","lineage":["https://openalex.org/I196829312"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kiki Adhinugraha","raw_affiliation_strings":["Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC 3086, Australia"],"raw_orcid":"https://orcid.org/0000-0001-5884-1409","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Technology, La Trobe University, Melbourne, VIC 3086, Australia","institution_ids":["https://openalex.org/I196829312"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065353209","display_name":"David Taniar","orcid":"https://orcid.org/0000-0002-8862-3960"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"David Taniar","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Melbourne, VIC 3800, Australia"],"raw_orcid":"https://orcid.org/0000-0002-8862-3960","affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Melbourne, VIC 3800, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065353209"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":6.5578,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.97514668,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"17","issue":"1","first_page":"29","last_page":"29"},"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/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"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9884999990463257,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.7707548141479492},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7617409229278564},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.6258019804954529},{"id":"https://openalex.org/keywords/point-of-interest","display_name":"Point of interest","score":0.5643913745880127},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.536983072757721},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5297796726226807},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5207274556159973},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.42794856429100037},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4245489835739136},{"id":"https://openalex.org/keywords/spatial-network","display_name":"Spatial network","score":0.42070674896240234},{"id":"https://openalex.org/keywords/distance-measures","display_name":"Distance measures","score":0.41015005111694336},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3094788193702698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16732412576675415},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11186710000038147}],"concepts":[{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.7707548141479492},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7617409229278564},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.6258019804954529},{"id":"https://openalex.org/C150140777","wikidata":"https://www.wikidata.org/wiki/Q960648","display_name":"Point of interest","level":2,"score":0.5643913745880127},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.536983072757721},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5297796726226807},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5207274556159973},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42794856429100037},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4245489835739136},{"id":"https://openalex.org/C53471067","wikidata":"https://www.wikidata.org/wiki/Q7574076","display_name":"Spatial network","level":2,"score":0.42070674896240234},{"id":"https://openalex.org/C2639959","wikidata":"https://www.wikidata.org/wiki/Q1344778","display_name":"Distance measures","level":2,"score":0.41015005111694336},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3094788193702698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16732412576675415},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11186710000038147},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.3390/a17010029","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17010029","pdf_url":"https://www.mdpi.com/1999-4893/17/1/29/pdf?version=1704885649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:monash.edu:openaire/58fb4f10-2dca-4d5c-ac36-2b76423897b3","is_oa":true,"landing_page_url":"https://research.monash.edu/en/publications/58fb4f10-2dca-4d5c-ac36-2b76423897b3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"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":"Tatit, P, Adhinugraha, K & Taniar, D 2024, 'Navigating the maps : Euclidean vs. road network distances in spatial queries', Algorithms, vol. 17, no. 1, 29. https://doi.org/10.3390/a17010029","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:doaj.org/article:9fd8335ecc3448229a9f1c14d613a208","is_oa":true,"landing_page_url":"https://doaj.org/article/9fd8335ecc3448229a9f1c14d613a208","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 17, Iss 1, p 29 (2024)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/17/1/29/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a17010029","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"},{"id":"pmh:oai:monash.edu:publications/58fb4f10-2dca-4d5c-ac36-2b76423897b3","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85182997632&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306402625","display_name":"Monash University Research Portal (Monash University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I56590836","host_organization_name":"Monash University","host_organization_lineage":["https://openalex.org/I56590836"],"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":"Tatit , P , Adhinugraha , K & Taniar , D 2024 , ' Navigating the maps : Euclidean vs. road network distances in spatial queries ' , Algorithms , vol. 17 , no. 1 , 29 . https://doi.org/10.3390/a17010029","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a17010029","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a17010029","pdf_url":"https://www.mdpi.com/1999-4893/17/1/29/pdf?version=1704885649","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4699999988079071,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390695045.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W96373761","https://openalex.org/W310638743","https://openalex.org/W1543003006","https://openalex.org/W1734314076","https://openalex.org/W1970696407","https://openalex.org/W1973002078","https://openalex.org/W2013600704","https://openalex.org/W2024199467","https://openalex.org/W2029189313","https://openalex.org/W2046144220","https://openalex.org/W2060029502","https://openalex.org/W2088171019","https://openalex.org/W2097597750","https://openalex.org/W2100381367","https://openalex.org/W2106936040","https://openalex.org/W2134780295","https://openalex.org/W2136046112","https://openalex.org/W2144931885","https://openalex.org/W2145413351","https://openalex.org/W2155668133","https://openalex.org/W2160080073","https://openalex.org/W2169336598","https://openalex.org/W2171901130","https://openalex.org/W2229332794","https://openalex.org/W2295268496","https://openalex.org/W2750705829","https://openalex.org/W2896183122","https://openalex.org/W2991333782","https://openalex.org/W3113897290","https://openalex.org/W3146266449","https://openalex.org/W3173788991","https://openalex.org/W6679618541","https://openalex.org/W6793396582"],"related_works":["https://openalex.org/W2129888254","https://openalex.org/W2115336194","https://openalex.org/W4294624291","https://openalex.org/W1563946824","https://openalex.org/W2809929944","https://openalex.org/W4389080932","https://openalex.org/W2571943156","https://openalex.org/W2169159254","https://openalex.org/W2908630341","https://openalex.org/W2896183122"],"abstract_inverted_index":{"Using":[0,97],"spatial":[1,38,46,261],"data":[2,39],"in":[3,32,121,198],"mobile":[4],"applications":[5],"has":[6],"grown":[7],"significantly,":[8],"thereby":[9,181,256],"empowering":[10],"users":[11,56],"to":[12,40,57,89,92,112],"explore":[13],"locations,":[14],"navigate":[15],"unfamiliar":[16],"areas,":[17],"find":[18,93],"transportation":[19],"routes,":[20],"employ":[21],"geomarketing":[22],"strategies,":[23],"and":[24,36,52,144,164,188,193],"model":[25],"environmental":[26],"factors.":[27],"Spatial":[28],"databases":[29],"are":[30,69],"pivotal":[31],"efficiently":[33],"storing,":[34],"retrieving,":[35],"manipulating":[37],"fulfill":[41],"users\u2019":[42],"needs.":[43],"Two":[44],"fundamental":[45],"query":[47,183,195,262],"types,":[48],"k-nearest":[49],"neighbors":[50],"(kNN)":[51],"range":[53,194],"search,":[54],"enable":[55],"access":[58],"specific":[59],"points":[60,184],"of":[61,116,170],"interest":[62],"(POIs)":[63],"based":[64,185,236],"on":[65,186,237],"their":[66],"location,":[67],"which":[68],"measured":[70],"by":[71,124],"actual":[72,81],"road":[73,82,129,207],"distance.":[74,96],"However,":[75],"retrieving":[76],"the":[77,90,94,102,114,117,128,139,150,168,171,199,206],"nearest":[78],"POIs":[79,122,251],"using":[80,191],"distance":[83,119,131,157,173,201,209],"can":[84],"be":[85],"computationally":[86],"intensive":[87],"due":[88],"need":[91],"shortest":[95],"straight-line":[98],"measurements":[99],"could":[100],"expedite":[101],"process":[103],"but":[104,226],"might":[105],"compromise":[106],"accuracy.":[107],"Consequently,":[108],"this":[109],"study":[110],"aims":[111],"evaluate":[113],"accuracy":[115,145,169,215,235,245],"Euclidean":[118,172,200],"method":[120,202],"retrieval":[123],"comparing":[125],"it":[126],"with":[127,240,249],"network":[130,208],"method.":[132,174,210],"The":[133,159,175,211],"primary":[134],"focus":[135],"is":[136,146,203],"determining":[137],"whether":[138],"trade-off":[140],"between":[141],"computational":[142],"time":[143],"justified,":[147],"thus":[148,221],"employing":[149],"Open":[151],"Source":[152],"Routing":[153],"Machine":[154],"(OSRM)":[155],"for":[156,216],"extraction.":[158],"assessment":[160],"encompasses":[161],"diverse":[162],"scenarios":[163],"analyses":[165],"factors":[166],"influencing":[167],"methodology":[176],"employs":[177],"a":[178],"quantitative":[179],"approach,":[180],"categorizing":[182],"density":[187],"analyzing":[189],"them":[190],"kNN":[192,217],"methods.":[196],"Accuracy":[197],"evaluated":[204],"against":[205],"results":[212],"demonstrate":[213],"peak":[214],"queries":[218,232],"at":[219],"k=1,":[220],"exceeding":[222],"85%":[223],"across":[224],"classes":[225,242],"declining":[227],"as":[228],"k":[229],"increases.":[230,246],"Range":[231],"show":[233],"varied":[234],"POI":[238],"density,":[239],"higher-density":[241],"exhibiting":[243],"earlier":[244],"Notably,":[247],"datasets":[248],"fewer":[250],"exhibit":[252],"unexpectedly":[253],"higher":[254],"accuracy,":[255],"providing":[257],"valuable":[258],"insights":[259],"into":[260],"processing.":[263]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":3}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}