{"id":"W2065822517","doi":"10.1016/j.comgeo.2005.11.005","title":"Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Convex hull; Simple (philosophy); Extreme point; Regular polygon; Combinatorics; SIMPLE algorithm; Mathematics; Algorithm; Line segment; Space (punctuation); Time complexity; Convex combination; Line (geometry); Computer science; Convex optimization; Geometry; Physics","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.0005527961,0.00189188,0.001403006,0.001844004,0.001117819,0.002408716,0.002185897,0.001282161,0.01421138],"category_scores_gemma":[0.004601211,0.0007879483,0.001229398,0.002774383,0.001060817,0.002927944,0.002886474,0.002322434,0.00400124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001342828,"about_ca_system_score_gemma":0.001605653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007122805,"about_ca_topic_score_gemma":0.01306201,"domain_scores_codex":[0.998951,0.0001232103,0.00006384681,0.0001688923,0.0005459173,0.0001471526],"domain_scores_gemma":[0.9977957,0.001206044,0.0001576403,0.0003715103,0.0003698583,0.00009937936],"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.0005726293,0.0002942806,0.001420054,0.0004829671,0.0001238075,0.0002223137,0.0004810482,0.2593491,0.01455568,0.05405701,0.01960933,0.6488317],"study_design_scores_gemma":[0.0001184518,0.00007018016,0.0002817239,0.00001929912,0.00002695012,0.00007531896,0.0001703969,0.9503974,0.005695506,0.0386729,0.004453909,0.000017889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115041,0.0002086664,0.9815627,0.0001471558,0.00004362812,0.0001262593,0.0001915139,0.002452334,0.003763505],"genre_scores_gemma":[0.1356935,0.0002492123,0.8578155,0.00007016665,0.00005145245,0.0002813951,0.001159822,0.000547509,0.004131398],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01421138,"threshold_uncertainty_score":0.0475418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01676834318866831,"score_gpt":0.2747161326910761,"score_spread":0.2579477895024078,"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."}}