{"id":"https://openalex.org/W2018347014","doi":"https://doi.org/10.1145/177424.177501","title":"Approximate Euclidean shortest path in 3-space","display_name":"Approximate Euclidean shortest path in 3-space","alternate_titles":[],"publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2018347014","doi":"https://doi.org/10.1145/177424.177501","mag":"2018347014"},"language":"en","primary_location":{"id":"doi:10.1145/177424.177501","doi":"https://doi.org/10.1145/177424.177501","is_oa":false,"landing_page_url":"https://doi.org/10.1145/177424.177501","pdf_url":null,"source":{"id":"https://openalex.org/S7407087995","display_name":"Annual Symposium on Computational Geometry (SoCG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth annual symposium on Computational geometry - SCG '94","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2018347014"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5041226473","display_name":"Joonsoo Choi","orcid":"https://orcid.org/0000-0003-0081-8200","observed_orcids":["https://orcid.org/0000-0003-0081-8200","https://orcid.org/0000-0003-0292-0583"]},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joonsoo Choi","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University","Courant Institute of Mathematical Sciences, New York University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University#TAB#","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024584350","display_name":"J\u00fcrgen Sellen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J\u00fcrgen Sellen","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University","Courant Institute of Mathematical Sciences, New York University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University#TAB#","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111579019","display_name":"Chee-Keng Yap","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36672615","display_name":"Courant Institute of Mathematical Sciences","ror":"https://ror.org/037tm7f56","country_code":"US","type":"education","lineage":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chee-Keng Yap","raw_affiliation_strings":["Courant Institute of Mathematical Sciences, New York University","Courant Institute of Mathematical Sciences, New York University#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]},{"raw_affiliation_string":"Courant Institute of Mathematical Sciences, New York University#TAB#","institution_ids":["https://openalex.org/I36672615","https://openalex.org/I57206974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.932,"has_fulltext":false,"cited_by_count":80,"citation_normalized_percentile":{"value":0.84908789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"41","last_page":"48"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6557999849319458,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.6557999849319458,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3425000011920929,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11435","display_name":"Polynomial and algebraic computation","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.9950000047683716},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8889999985694885},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.8069999814033508},{"id":"https://openalex.org/keywords/subdivision-method","display_name":"subdivision method","score":0.7699999809265137}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.7374110221862793},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6487382650375366},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.6468991041183472},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5703874230384827},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.538726806640625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5198443531990051},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4995412826538086},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48786425590515137},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45538899302482605},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.45036599040031433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43207111954689026},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3836933970451355},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3818112015724182},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37534797191619873},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35923221707344055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3535071015357971},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30171918869018555},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1315741240978241},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06339654326438904},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/177424.177501","doi":"https://doi.org/10.1145/177424.177501","is_oa":false,"landing_page_url":"https://doi.org/10.1145/177424.177501","pdf_url":null,"source":{"id":"https://openalex.org/S7407087995","display_name":"Annual Symposium on Computational Geometry (SoCG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth annual symposium on Computational geometry - SCG '94","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.4268","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.4268","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://cs.nyu.edu/pub/tech-reports/./tr670.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1906607213","https://openalex.org/W2024693023","https://openalex.org/W2036114412","https://openalex.org/W2043121086","https://openalex.org/W2156316434","https://openalex.org/W2166717942","https://openalex.org/W2170220350"],"related_works":["https://openalex.org/W2171665075","https://openalex.org/W191527053","https://openalex.org/W6963388513","https://openalex.org/W1603579758","https://openalex.org/W1980197133","https://openalex.org/W7097582577","https://openalex.org/W2123676901","https://openalex.org/W7100897584","https://openalex.org/W2128301663"],"abstract_inverted_index":{"Papadimitriou's":[0],"approximation":[1],"approach":[2,20],"to":[3,47],"the":[4,34,57],"Euclidean":[5],"shortest":[6],"path":[7],"(ESP)":[8],"problem":[9,16],"in":[10,33],"3-space":[11],"is":[12,17],"revisited.":[13],"As":[14],"this":[15],"NP-hard,":[18],"his":[19,48],"represents":[21],"an":[22,45],"important":[23],"step":[24],"towards":[25],"practical":[26],"algorithms.":[27],"Unfortunately,":[28],"there":[29],"are":[30,60],"non-trivial":[31,64],"gaps":[32],"original":[35],"description.":[36],"Besides":[37],"giving":[38],"a":[39],"complete":[40],"treatment,":[41],"we":[42],"also":[43],"give":[44],"alternative":[46],"subdivision":[49],"method":[50],"which":[51],"has":[52],"some":[53],"nice":[54],"properties.":[55],"Among":[56],"tools":[58],"needed":[59],"root-separation":[61],"bounds":[62,69],"and":[63],"applications":[65],"of":[66,72],"Brent's":[67],"complexity":[68],"on":[70],"evaluation":[71],"elementary":[73],"functions":[74],"using":[75],"floating":[76],"point":[77],"numbers.":[78]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2018347014","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
