{"id":"W1556623511","doi":"10.1007/978-3-540-24698-5_20","title":"Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex hull; Partition (number theory); Simple (philosophy); SIMPLE algorithm; Regular polygon; Computer science; Algorithm; Extreme point; Line segment; Time complexity; Combinatorics; Mathematics; Geometry; Artificial intelligence","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001546846,0.0004063998,0.0005434045,0.0008020535,0.0002407854,0.0001725474,0.001915727,0.00021287,0.00001565458],"category_scores_gemma":[0.0001541908,0.0003298597,0.0001739478,0.001041123,0.000462376,0.0001700943,0.0008008495,0.0005113164,0.00001358888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002640559,"about_ca_system_score_gemma":0.001000746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003520926,"about_ca_topic_score_gemma":0.00002624294,"domain_scores_codex":[0.9966964,0.00004384995,0.0007422921,0.001069043,0.000897381,0.0005510626],"domain_scores_gemma":[0.9971796,0.001168959,0.0004137122,0.0007109038,0.0004247117,0.0001021295],"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.000009331945,0.00005289621,0.000006842176,0.00003135821,0.000007875702,0.000008518879,0.0005871289,0.8665373,0.0002474394,0.01702366,0.000009581081,0.1154781],"study_design_scores_gemma":[0.0005368975,0.000230284,0.00010053,0.0002054442,0.000006101462,0.00002601217,2.945451e-7,0.9334616,0.002252716,0.06246098,0.0003898311,0.0003292816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001048357,0.0003487255,0.9951743,0.001325813,0.00104558,0.0007897685,0.00001964889,0.00005487774,0.0001928718],"genre_scores_gemma":[0.4227856,0.00000977607,0.5751285,0.0009730051,0.0008399539,0.00001182541,0.00003784342,0.00003151134,0.0001819547],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4217373,"threshold_uncertainty_score":0.9999154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02007644781330867,"score_gpt":0.2715390086510671,"score_spread":0.2514625608377584,"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."}}