{"id":"W2120092636","doi":"10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Simple polygon; Mathematics; Link (geometry); Polygon (computer graphics); Vertex (graph theory); Upper and lower bounds; Algorithm; Geometry; Graph; Regular polygon; Computer science; Mathematical analysis","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.0003218781,0.001038569,0.0006699101,0.001018623,0.0008946757,0.001468973,0.001858923,0.001003925,0.03511042],"category_scores_gemma":[0.00174004,0.00051824,0.0006959162,0.001700968,0.0006523234,0.001999998,0.001780449,0.0009572529,0.01254273],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007391991,"about_ca_system_score_gemma":0.001076689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001943162,"about_ca_topic_score_gemma":0.004798666,"domain_scores_codex":[0.9995719,0.00005686167,0.00003220169,0.0001393937,0.0001408603,0.00005886359],"domain_scores_gemma":[0.9990545,0.0003746357,0.0001159193,0.0002441709,0.0001339279,0.00007686],"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.0006672618,0.0002701694,0.0008690688,0.0005968313,0.00005102241,0.0002506246,0.0002346807,0.01811986,0.03028097,0.01190876,0.06476483,0.8719859],"study_design_scores_gemma":[0.001149943,0.0006929139,0.003680033,0.0002769267,0.0001251367,0.002164571,0.0008335841,0.593743,0.05293436,0.1116792,0.232539,0.0001814486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01875254,0.0005047056,0.9405771,0.0005853641,0.0001653912,0.0003967762,0.0008353005,0.01236917,0.02581366],"genre_scores_gemma":[0.07300325,0.0003182442,0.9080227,0.000154088,0.00004910378,0.0003317393,0.001853103,0.001184067,0.01508365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03511042,"threshold_uncertainty_score":0.117456,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01541237706406974,"score_gpt":0.3034792372735612,"score_spread":0.2880668602094915,"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."}}