{"id":"https://openalex.org/W2043285556","doi":"https://doi.org/10.1145/1247069.1247082","title":"Querying approximate shortest paths in anisotropic regions","display_name":"Querying approximate shortest paths in anisotropic regions","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2043285556","doi":"https://doi.org/10.1145/1247069.1247082","mag":"2043285556"},"language":"en","primary_location":{"id":"doi:10.1145/1247069.1247082","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1247069.1247082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual symposium on Computational geometry  - SCG '07","raw_type":"proceedings-article"},"type":"preprint","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/A5070497738","display_name":"Siu-Wing Cheng","orcid":"https://orcid.org/0000-0002-3557-9935"},"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":"Siu-Wing Cheng","raw_affiliation_strings":["HKUST, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"HKUST, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059099525","display_name":"Hyeon-Suk Na","orcid":null},"institutions":[{"id":"https://openalex.org/I141371507","display_name":"Soongsil University","ror":"https://ror.org/017xnm587","country_code":"KR","type":"education","lineage":["https://openalex.org/I141371507"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeon-Suk Na","raw_affiliation_strings":["Soongsil University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"Soongsil University, Seoul, South Korea","institution_ids":["https://openalex.org/I141371507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019937157","display_name":"Antoine Vigneron","orcid":"https://orcid.org/0000-0003-3586-3431"},"institutions":[{"id":"https://openalex.org/I1314251682","display_name":"Institut National de la Recherche Agronomique","ror":"https://ror.org/05y503v71","country_code":"MA","type":"facility","lineage":["https://openalex.org/I1314251682"]},{"id":"https://openalex.org/I4210099460","display_name":"Centre \u00cele-de-France - Jouy-en-Josas - Antony","ror":"https://ror.org/00gtg0p11","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4210088668","https://openalex.org/I4210099460"]}],"countries":["FR","MA"],"is_corresponding":false,"raw_author_name":"Antoine Vigneron","raw_affiliation_strings":["INRA, Jouy-en-Josas, France","INRA Jouy en Josas France"],"affiliations":[{"raw_affiliation_string":"INRA, Jouy-en-Josas, France","institution_ids":["https://openalex.org/I4210099460"]},{"raw_affiliation_string":"INRA Jouy en Josas France","institution_ids":["https://openalex.org/I1314251682"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100454894","display_name":"Yajun Wang","orcid":"https://orcid.org/0000-0002-9990-0812"},"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":"Yajun Wang","raw_affiliation_strings":["HKUST, Hong Kong, Hong Kong"],"affiliations":[{"raw_affiliation_string":"HKUST, Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070497738"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":3.5667,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.93371226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"84","last_page":"84"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6085386276245117},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5306248664855957},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4558294415473938},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36521852016448975},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3342598080635071},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09116250276565552}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6085386276245117},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5306248664855957},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4558294415473938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36521852016448975},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3342598080635071},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09116250276565552}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1145/1247069.1247082","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1247069.1247082","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual symposium on Computational geometry  - SCG '07","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.2877","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.2877","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/~ghodsi/archive/downloaded-papers/ACM SoCG/2007/Querying Approximate Shortest Paths in Anisotropic Regions.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.7744","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.7744","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ust.hk/~scheng/pub/socg07.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.305","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.305","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ust.hk/~scheng/pub/socg07.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.170.6566","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.170.6566","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://w3.jouy.inra.fr/unites/miaj/public/vigneron/preprints/querying.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.180.4757","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.180.4757","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/pubs/122165/74216.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.8852","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.8852","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ust.hk/%7Escheng/pub/query-path.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-02750642v1","is_oa":false,"landing_page_url":"https://hal.inrae.fr/hal-02750642","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://gateway.isiknowledge.com/gateway/Gateway.cgi?&GWVersion=2&SrcAuth=INRA&SrcApp=INRA&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000277584700008","raw_type":"Conference papers"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-36424","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-36424","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference paper"},{"id":"pmh:oai:scholarworks.unist.ac.kr:201301/34481","is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=1247082&CFID=639749174&CFTOKEN=76434841","pdf_url":null,"source":{"id":"https://openalex.org/S4306401118","display_name":"Scholarworks@UNIST (Ulsan National Institute of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I48566637","host_organization_name":"Ulsan National Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I48566637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"CONFERENCE"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W40061580","https://openalex.org/W1507556857","https://openalex.org/W1559701472","https://openalex.org/W1583421438","https://openalex.org/W1989723858","https://openalex.org/W1996942467","https://openalex.org/W2000744043","https://openalex.org/W2009017109","https://openalex.org/W2018164813","https://openalex.org/W2025130628","https://openalex.org/W2028769163","https://openalex.org/W2031247977","https://openalex.org/W2037134555","https://openalex.org/W2049480565","https://openalex.org/W2058510050","https://openalex.org/W2063071084","https://openalex.org/W2112346596","https://openalex.org/W2149906774","https://openalex.org/W2720255354","https://openalex.org/W3136732126"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,15,23,35,52,84,96],"data":[3,81,114],"structure":[4,82,115],"for":[5,65],"answering":[6],"approximate":[7],"shortest":[8,88,103],"path":[9,89,104],"queries":[10],"ina":[11],"planar":[12],"subdivision":[13,31,144],"from":[14,91],"fixed":[16,93],"source.":[17],"Let":[18,71],"\u03c1":[19],"\u2265":[20],"1":[21],"be":[22,63,73,106,124],"real":[24],"number.Distances":[25],"in":[26,45,98,108,111,126],"each":[27],"face":[28],"of":[29,86,142],"this":[30],"are":[32,69],"measured":[33],"by":[34],"possiblyasymmetric":[36],"convex":[37,59],"distance":[38,60],"function":[39],"whose":[40],"unit":[41,47],"disk":[42,55],"is":[43],"contained":[44],"aconcentric":[46],"Euclidean":[48,54],"disk,":[49],"and":[50,67,122,133],"contains":[51],"concentric":[53],"withradius":[56],"1/\u03c1.":[57],"Different":[58],"functions":[61],"may":[62],"used":[64],"differentfaces,":[66],"obstacles":[68],"allowed.":[70],"\u03b5":[72],"any":[74],"number":[75],"strictly":[76],"between":[77],"0and":[78],"1.":[79],"Our":[80,131],"returns":[83],"(1+\u03b5)approximation":[85],"the":[87,92,143,147],"cost":[90],"source":[94],"to":[95],"querydestination":[97],"O(log\u03c1n/\u03b5)":[99],"time.":[100,130],"Afterwards,":[101],"a(1+\u03b5)-approximate":[102],"can":[105,123],"reported":[107],"time":[109,132],"linear":[110],"itscomplexity.":[112],"The":[113],"uses":[116],"O(\u03c12":[117],"n4/\u03b52":[118],"log":[119],"\u03c1n/\u03b5)":[120],"space":[121,134],"built":[125],"O((\u03c12":[127],"n4)/(\u03b52)(log":[128],"\u03c1n/\u03b5)2)":[129],"bounds":[135],"do":[136],"not":[137],"depend":[138],"onany":[139],"geometric":[140],"parameter":[141],"such":[145],"as":[146],"minimum":[148],"angle.":[149]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}