{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004541245,0.0001897569,0.0002182684,0.0002710985,0.0002238112,0.00006872489,0.0006740898,0.00005992678,0.00007451813],"category_scores_gemma":[0.0001230138,0.0001175317,0.0002118475,0.000826602,0.00009476108,0.0004143981,0.0001987116,0.000066229,0.00006617762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004512248,"about_ca_system_score_gemma":0.0001420052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008658999,"about_ca_topic_score_gemma":8.423476e-7,"domain_scores_codex":[0.9982362,0.00006724301,0.0004339789,0.0004188536,0.000536845,0.0003068266],"domain_scores_gemma":[0.9972888,0.001644386,0.0002164512,0.0003421202,0.0004168489,0.00009143404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004516076,0.0001859809,0.0004240699,0.00002785211,0.0002018806,0.000002457728,0.0001767746,0.05098666,0.001803184,0.04070153,0.004102355,0.9013421],"study_design_scores_gemma":[0.001244734,0.0001746165,0.007716948,0.00002942235,0.00001925353,0.00002028392,0.0000106777,0.9529905,0.001396415,0.02834302,0.007814148,0.0002400252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01058285,0.0001859938,0.9862086,0.001964848,0.0002829203,0.0003796661,0.0002101553,0.00007519795,0.0001098223],"genre_scores_gemma":[0.745335,0.00001162855,0.2526908,0.0005926878,0.0003577811,0.00007060368,0.0001769519,0.00002140568,0.000743158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9020038,"threshold_uncertainty_score":0.4792802,"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."}}