{"id":"https://openalex.org/W2962701233","doi":"https://doi.org/10.4230/lipics.esa.2016.77","title":"On the Geodesic Centers of Polygonal Domains","display_name":"On the Geodesic Centers of Polygonal Domains","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2962701233","doi":"https://doi.org/10.4230/lipics.esa.2016.77","mag":"2962701233"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6418","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.77","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100457237","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0003-1312-6414"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wang, Haitao","raw_affiliation_strings":["UTAH STATE UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"UTAH STATE UNIVERSITY","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100457237"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37068966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"57","issue":"1","first_page":"17","last_page":null},"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.9993000030517578,"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.9993000030517578,"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.965399980545044,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9623000025749207,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/geodesic","display_name":"Geodesic","score":0.8999420404434204},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6439310312271118},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.635180652141571},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.582665205001831},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5493157505989075},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5445386171340942},{"id":"https://openalex.org/keywords/center","display_name":"Center (category theory)","score":0.5339995622634888},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.43671470880508423},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43667319416999817},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42481040954589844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29496946930885315},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.26702892780303955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24275797605514526},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18724989891052246},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.13697382807731628},{"id":"https://openalex.org/keywords/crystallography","display_name":"Crystallography","score":0.05748128890991211}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.8999420404434204},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6439310312271118},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.635180652141571},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.582665205001831},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5493157505989075},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5445386171340942},{"id":"https://openalex.org/C2779463800","wikidata":"https://www.wikidata.org/wiki/Q5062222","display_name":"Center (category theory)","level":2,"score":0.5339995622634888},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.43671470880508423},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43667319416999817},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42481040954589844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29496946930885315},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.26702892780303955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24275797605514526},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18724989891052246},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.13697382807731628},{"id":"https://openalex.org/C8010536","wikidata":"https://www.wikidata.org/wiki/Q160398","display_name":"Crystallography","level":1,"score":0.05748128890991211},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:6418","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:digitalcommons.usu.edu:computer_science_facpubs-1002","is_oa":true,"landing_page_url":"https://digitalcommons.usu.edu/computer_science_facpubs/4","pdf_url":"https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=1002&context=computer_science_facpubs","source":{"id":"https://openalex.org/S4377196327","display_name":"Digital Commons - USU (Utah State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121980950","host_organization_name":"Utah State University","host_organization_lineage":["https://openalex.org/I121980950"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty and Staff Publications","raw_type":"text"},{"id":"doi:10.4230/lipics.esa.2016.77","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2016.77","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2962701233","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2016/6418/pdf/LIPIcs-ESA-2016-77.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418381","display_name":"European Symposium on Algorithms","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Symposium on Algorithms","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6418","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.77","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4390457765","display_name":null,"funder_award_id":"CCF-1317143","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4642653475","display_name":"AF: Small: Algorithms for Computational Geometry Problems in Polygonal Domains","funder_award_id":"1317143","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1610448541","https://openalex.org/W2493913654","https://openalex.org/W2766044635","https://openalex.org/W2294820318","https://openalex.org/W2904659240","https://openalex.org/W2142626991","https://openalex.org/W2963983371","https://openalex.org/W12856054","https://openalex.org/W2062556295","https://openalex.org/W1603304584","https://openalex.org/W2022670034","https://openalex.org/W2081777693","https://openalex.org/W1496381256","https://openalex.org/W2625660001","https://openalex.org/W1974931598","https://openalex.org/W2012669981","https://openalex.org/W2109278560","https://openalex.org/W2221579990","https://openalex.org/W1549431641","https://openalex.org/W2392477087"],"abstract_inverted_index":{"In":[0],"this":[1,121],"paper,":[2],"we":[3,100],"study":[4],"the":[5,56,65,68],"problem":[6],"of":[7,12,17,45,59,67,74,115],"computing":[8],"Euclidean":[9],"geodesic":[10,30,40,60,107],"centers":[11,61,108],"a":[13,22,26,29,86],"polygonal":[14],"domain":[15],"P":[16,46],"n":[18],"vertices.":[19],"We":[20,32],"give":[21],"necessary":[23],"condition":[24],"for":[25,120,123],"point":[27],"being":[28],"center.":[31],"show":[33],"that":[34,47,55,104],"there":[35],"is":[36,62,77,85],"at":[37],"most":[38],"one":[39],"center":[41],"among":[42],"all":[43,106],"points":[44,94],"have":[48],"topologically-equivalent":[49],"shortest":[50,69,90],"path":[51,70,91],"maps.":[52],"This":[53],"implies":[54],"total":[57],"number":[58],"bounded":[63],"by":[64],"size":[66],"map":[71],"equivalence":[72],"decomposition":[73],"P,":[75],"which":[76],"known":[78,119],"to":[79],"be":[80],"O(n^{10}).":[81],"One":[82],"key":[83],"observation":[84],"pi-range":[87],"property":[88],"on":[89],"lengths":[92],"when":[93],"are":[95],"moving.":[96],"With":[97],"these":[98],"observations,":[99],"propose":[101],"an":[102,113],"algorithm":[103,114],"computes":[105],"in":[109],"O(n^{11}*log(n))":[110],"time.":[111],"Previously,":[112],"O(n^{12+epsilon})":[116],"time":[117],"was":[118],"problem,":[122],"any":[124],"epsilon":[125],">":[126],"0.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}