{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008746436,0.0001986106,0.0002913738,0.0005142676,0.0002062215,0.00007642484,0.0005555172,0.00007648916,0.0000228556],"category_scores_gemma":[0.0001298903,0.0001735277,0.000147003,0.001792283,0.00009337096,0.0001339108,0.0002080526,0.0001532258,0.00003037585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006816653,"about_ca_system_score_gemma":0.0002146297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004731015,"about_ca_topic_score_gemma":0.000004007914,"domain_scores_codex":[0.9978971,0.00009213942,0.0006529056,0.0004415597,0.0005781894,0.0003381307],"domain_scores_gemma":[0.9974861,0.001473636,0.0002769346,0.0002465003,0.0004575437,0.0000592969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000158744,0.0002110924,0.0003333401,0.00002177868,0.00001574959,0.000002227743,0.00009224722,0.958491,0.0003511052,0.033742,0.0009439766,0.005779573],"study_design_scores_gemma":[0.0008575613,0.0001043164,0.016353,0.00001875156,0.000006834746,0.00001724369,0.00001466514,0.9620961,0.0007124654,0.01849464,0.001139792,0.0001846253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.183436,0.0002696687,0.8143923,0.0009782658,0.0002974721,0.0003866849,0.00003961551,0.00005657491,0.0001434425],"genre_scores_gemma":[0.8504989,8.449134e-7,0.1484176,0.0002442379,0.0003740252,0.0000149584,0.0002419287,0.00001276133,0.0001948356],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6670628,"threshold_uncertainty_score":0.7076255,"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."}}