{"id":"https://openalex.org/W2120092636","doi":"https://doi.org/10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","display_name":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","publication_year":2000,"publication_date":"2000-04-01","ids":{"openalex":"https://openalex.org/W2120092636","doi":"https://doi.org/10.1142/s0218195900000103","mag":"2120092636"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195900000103","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195900000103","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-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/A5040639996","display_name":"Lyudmil Aleksandrov","orcid":null},"institutions":[{"id":"https://openalex.org/I24768866","display_name":"Bulgarian Academy of Sciences","ror":"https://ror.org/01x8hew03","country_code":"BG","type":"funder","lineage":["https://openalex.org/I24768866"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"LYUDMIL G. ALEKSANDROV","raw_affiliation_strings":["Bulgarian Academy of Sciences, CICT, Acad. G. Bonchev Str., Bl. 25-A, 1113 Sofia, Bulgaria"],"affiliations":[{"raw_affiliation_string":"Bulgarian Academy of Sciences, CICT, Acad. G. Bonchev Str., Bl. 25-A, 1113 Sofia, Bulgaria","institution_ids":["https://openalex.org/I24768866"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057625550","display_name":"Hristo Djidjev","orcid":"https://orcid.org/0000-0001-9286-8824"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"HRISTO N. DJIDJEV","raw_affiliation_strings":["Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Warwick, Coventry, CV4 7AL, England, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085978384","display_name":"J\u00f6rg-R\u00fcdiger Sack","orcid":"https://orcid.org/0000-0001-5936-1319"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J\u00d6RG-R\u00dcDIGER SACK","raw_affiliation_strings":["School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada","School of Computer Science, Carleton University, Ottawa, Ontario. K1S 5B6, Canada"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Ontario. K1S 5B6, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040639996"],"corresponding_institution_ids":["https://openalex.org/I24768866"],"apc_list":null,"apc_paid":null,"fwci":0.8102,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78838015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"02","first_page":"157","last_page":"188"},"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.9998000264167786,"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.9998000264167786,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962000250816345,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/combinatorics","display_name":"Combinatorics","score":0.7388777732849121},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.7330657243728638},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7251391410827637},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.6152030229568481},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5818865299224854},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5778457522392273},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41612547636032104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.333699107170105},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.18218427896499634},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17148160934448242},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.15803152322769165},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1352960765361786},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06199684739112854}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7388777732849121},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7330657243728638},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7251391410827637},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.6152030229568481},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5818865299224854},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5778457522392273},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41612547636032104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.333699107170105},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.18218427896499634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17148160934448242},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.15803152322769165},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1352960765361786},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06199684739112854},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195900000103","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195900000103","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry &amp; Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1825136300","https://openalex.org/W2001876175","https://openalex.org/W2002025203","https://openalex.org/W2038699153","https://openalex.org/W2043144539","https://openalex.org/W2085681674","https://openalex.org/W2100008148","https://openalex.org/W2128830892","https://openalex.org/W2132339863","https://openalex.org/W2158647255","https://openalex.org/W2164507028","https://openalex.org/W2172079505","https://openalex.org/W2172137407","https://openalex.org/W4299815227"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565","https://openalex.org/W1963624385"],"abstract_inverted_index":{"A":[0],"central":[1,56,89,97],"link":[2,33,57,90,98],"segment":[3,12,58,71,91,99],"of":[4,40,59,72,92,105],"a":[5,11,55,70,88,96,112,125],"simple":[6],"n-vertex":[7],"polygon":[8,127],"P":[9,15,73,76],"is":[10,31,77,128],"s":[13],"inside":[14],"that":[16],"minimizes":[17],"the":[18,32,81,103,119],"quantity":[19],"max":[20],"x\u2208P":[21],"min":[22],"y\u2208s":[23],"d":[24,28],"L":[25,29],"(x,y),":[26],"where":[27],"(x,y)":[30],"distance":[34],"between":[35],"points":[36],"x":[37],"and":[38,117],"y":[39],"P.":[41,60],"In":[42],"this":[43],"paper":[44],"we":[45],"present":[46],"an":[47,67,107],"O":[48],"(n":[49],"log":[50],"n)":[51],"algorithm":[52,86],"for":[53,65,123],"finding":[54,66,106],"This":[61],"generalizes":[62],"previous":[63],"results":[64],"edge":[68],"or":[69],"from":[74,130],"which":[75,124],"visible.":[78],"Moreover,":[79],"in":[80,111],"same":[82],"time":[83],"bound,":[84],"our":[85],"finds":[87],"minimum":[93,120],"length.":[94],"Constructing":[95],"has":[100],"applications":[101],"to":[102],"problems":[104],"optimal":[108],"robot":[109],"placement":[110],"simply":[113],"connected":[114],"polygonal":[115],"region":[116],"determining":[118],"value":[121],"k":[122],"given":[126],"k-visible":[129],"some":[131],"segment.":[132]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}