{"id":"https://openalex.org/W6925887548","doi":"https://doi.org/10.20382/jocg.v16i1a13","title":"Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon","display_name":"Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon","publication_year":2024,"publication_date":"2024-02-01","ids":{"openalex":"https://openalex.org/W6925887548","doi":"https://doi.org/10.20382/jocg.v16i1a13"},"language":"en","primary_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4735","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4735","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://jocg.org/index.php/jocg/article/view/4735","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Bose, Prosenjit","orcid":"https://orcid.org/0000-0002-8906-0573"},"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":true,"raw_author_name":"Bose, Prosenjit","raw_affiliation_strings":["Carleton University"],"affiliations":[{"raw_affiliation_string":"Carleton University","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":null,"display_name":"D'Angelo, Anthony","orcid":null},"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":"D'Angelo, Anthony","raw_affiliation_strings":["Carleton University"],"affiliations":[{"raw_affiliation_string":"Carleton University","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":null,"display_name":"Durocher, Stephane","orcid":"https://orcid.org/0000-0002-6589-3538"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Durocher, Stephane","raw_affiliation_strings":["University of Manitoba"],"affiliations":[{"raw_affiliation_string":"University of Manitoba","institution_ids":["https://openalex.org/I46247651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52851564,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10978","display_name":"Prenatal Screening and Diagnostics","score":0.1800999939441681,"subfield":{"id":"https://openalex.org/subfields/2735","display_name":"Pediatrics, Perinatology and Child Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},"topics":[{"id":"https://openalex.org/T10978","display_name":"Prenatal Screening and Diagnostics","score":0.1800999939441681,"subfield":{"id":"https://openalex.org/subfields/2735","display_name":"Pediatrics, Perinatology and Child Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T12552","display_name":"Fetal and Pediatric Neurological Disorders","score":0.04989999905228615,"subfield":{"id":"https://openalex.org/subfields/2735","display_name":"Pediatrics, Perinatology and Child Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}},{"id":"https://openalex.org/T11732","display_name":"Assisted Reproductive Technology and Twin Pregnancy","score":0.03920000046491623,"subfield":{"id":"https://openalex.org/subfields/2735","display_name":"Pediatrics, Perinatology and Child Health"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/geodesic","display_name":"Geodesic","score":0.866599977016449},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.7210999727249146},{"id":"https://openalex.org/keywords/voronoi-diagram","display_name":"Voronoi diagram","score":0.6388999819755554},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5164999961853027},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.47130000591278076},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4196999967098236},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4115999937057495},{"id":"https://openalex.org/keywords/simple-algorithm","display_name":"SIMPLE algorithm","score":0.39649999141693115},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.3919999897480011}],"concepts":[{"id":"https://openalex.org/C165818556","wikidata":"https://www.wikidata.org/wiki/Q213488","display_name":"Geodesic","level":2,"score":0.866599977016449},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.7210999727249146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7035999894142151},{"id":"https://openalex.org/C24881265","wikidata":"https://www.wikidata.org/wiki/Q757267","display_name":"Voronoi diagram","level":2,"score":0.6388999819755554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.616100013256073},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5164999961853027},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.47130000591278076},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4196999967098236},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4115999937057495},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.39649999141693115},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.3919999897480011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3797999918460846},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.3628999888896942},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.3343999981880188},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31520000100135803},{"id":"https://openalex.org/C150397156","wikidata":"https://www.wikidata.org/wiki/Q591310","display_name":"General position","level":2,"score":0.2912999987602234},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28369998931884766},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2815000116825104},{"id":"https://openalex.org/C182860218","wikidata":"https://www.wikidata.org/wiki/Q633674","display_name":"Polygonal chain","level":3,"score":0.2777999937534332},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C185877587","wikidata":"https://www.wikidata.org/wiki/Q1757407","display_name":"Medial axis","level":2,"score":0.26339998841285706},{"id":"https://openalex.org/C187778580","wikidata":"https://www.wikidata.org/wiki/Q18389289","display_name":"Polygon covering","level":3,"score":0.26179999113082886},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ojs.library.carleton.ca:article/4735","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4735","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.20382/jocg.v16i1a13","is_oa":true,"landing_page_url":"https://doi.org/10.20382/jocg.v16i1a13","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"article-journal"}],"best_oa_location":{"id":"pmh:oai:ojs.library.carleton.ca:article/4735","is_oa":true,"landing_page_url":"https://jocg.org/index.php/jocg/article/view/4735","pdf_url":null,"source":{"id":"https://openalex.org/S4306400962","display_name":"Journal of Computational Geometry (Carleton University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67031392","host_organization_name":"Carleton University","host_organization_lineage":["https://openalex.org/I67031392"],"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":"10.20382/jocg.v16i1","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,37,47,77],"consider":[1],"the":[2,155],"problem":[3],"of":[4,9,20,32,100,151],"finding":[5],"a":[6,18,24,41,44,53,85,101,108],"geodesic":[7,58,86],"disc":[8,42,55,87],"smallest":[10],"radius":[11,94],"containing":[12,88],"at":[13,89,96],"least":[14,90],"$k$":[15,91],"points":[16,22,92],"from":[17],"set":[19],"$n$":[21],"in":[23,113,134],"simple":[25],"polygon":[26],"that":[27,83,99,154],"has":[28],"$m$":[29],"vertices,":[30],"$r$":[31],"which":[33],"are":[34],"reflex":[35],"vertices.":[36],"refer":[38],"to":[39,51],"such":[40],"as":[43],"SKEG":[45,54,102],"disc.":[46,103],"present":[48,79],"an":[49],"algorithm":[50,106,132,157],"compute":[52],"using":[56,144],"higher-order":[57],"Voronoi":[59],"diagrams":[60],"with":[61,110,125],"worst-case":[62,123],"time":[63,124,143],"$O(k^{2}":[64],"n":[65,118,137],"+":[66,69,72,121,127,140,146],"k^{2}":[67],"r":[68,120,139],"\\min(kr,":[70],"r(n-k))":[71],"m)$":[73,122,128,141,147],"ignoring":[74],"polylogarithmic":[75],"factors.":[76],"then":[78],"two":[80],"2-approximation":[81,109],"algorithms":[82],"find":[84],"whose":[93],"is":[95,158],"most":[97],"twice":[98],"The":[104,130],"first":[105,156],"computes":[107],"high":[111],"probability":[112],"$O((n^{2}":[114],"/":[115,164],"k)":[116],"\\log":[117,119,138,165],"$O(n":[126,135,145],"space.":[129],"second":[131],"runs":[133],"\\log^{2}":[136],"expected":[142,148],"space,":[149],"independent":[150],"$k$.":[152],"Note":[153],"faster":[159],"when":[160],"$k":[161],"\\in":[162],"\\omega(n":[163],"n)$.":[166]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}