{"id":"W1610448541","doi":"10.1007/s00454-016-9796-0","title":"A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"National Institutes of Natural Sciences; National Research Foundation of Korea","keywords":"Geodesic; Simple polygon; Mathematics; Combinatorics; Center (category theory); Polygon (computer graphics); Time complexity; Simple (philosophy); Path (computing); Shortest path problem; Point (geometry); Algorithm; Discrete mathematics; Regular polygon; Geometry; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798085,0.001222883,0.001252637,0.001369186,0.001139639,0.001421298,0.002285911,0.001143738,0.01976264],"category_scores_gemma":[0.002269447,0.0006809468,0.0009340059,0.001282516,0.0007879535,0.001496343,0.002933722,0.001469921,0.004408497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001328317,"about_ca_system_score_gemma":0.001871544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008683404,"about_ca_topic_score_gemma":0.01068867,"domain_scores_codex":[0.9995725,0.00003924159,0.00002107047,0.0001147885,0.0001896967,0.0000627366],"domain_scores_gemma":[0.9993361,0.0002317349,0.00004607872,0.0001233881,0.0001876373,0.0000750969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005247935,0.0001670059,0.001190531,0.0003490734,0.0000801362,0.0002830371,0.0003516615,0.1348144,0.02048501,0.04596155,0.01900012,0.7767927],"study_design_scores_gemma":[0.0001873029,0.0001095526,0.0002339434,0.00002254835,0.00002809612,0.000130302,0.0001328036,0.9569904,0.009056273,0.02268463,0.01039511,0.00002914577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009738539,0.0001042864,0.981384,0.0001109118,0.00008570858,0.0001814878,0.0001105566,0.003899091,0.004385514],"genre_scores_gemma":[0.1046683,0.00009969652,0.8893126,0.00004657697,0.00003832966,0.0001656278,0.0005089847,0.0008642183,0.004295628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01976264,"threshold_uncertainty_score":0.06611258,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01326279494017085,"score_gpt":0.2650907485037944,"score_spread":0.2518279535636236,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}