{"id":"W2584694570","doi":"","title":"Space-Efficient Algorithms for Computing the Convex Hull of a Simple Polygonal Line in Linear Time","year":2007,"lang":"en","type":"article","venue":"","topic":"Hermeneutics and Narrative Identity","field":"Arts and Humanities","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Convex hull; Simple (philosophy); Algorithm; Extreme point; Computer science; SIMPLE algorithm; Regular polygon; Combinatorics; Time complexity; Line segment; Mathematics; Geometry","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.0007725412,0.002419293,0.001419502,0.001612691,0.001656348,0.003406097,0.003209664,0.001704219,0.02025615],"category_scores_gemma":[0.005239147,0.0009081837,0.001959948,0.003160242,0.001302954,0.005237065,0.003506738,0.002583434,0.007182028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001901662,"about_ca_system_score_gemma":0.002191473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005386718,"about_ca_topic_score_gemma":0.01264012,"domain_scores_codex":[0.9986167,0.0001968134,0.0001229057,0.0003142647,0.0005040006,0.0002452711],"domain_scores_gemma":[0.9977463,0.001108173,0.0001692746,0.0005648327,0.0002904868,0.0001209714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006457279,0.0004686067,0.001681,0.001006969,0.0001986327,0.0002789907,0.0008762248,0.1222137,0.01154802,0.07565898,0.03999741,0.7454258],"study_design_scores_gemma":[0.0003630159,0.00019543,0.0007225639,0.000074745,0.00008513879,0.0003311349,0.0007703486,0.7610564,0.01015122,0.205597,0.02057788,0.00007524379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0145005,0.0003609795,0.9709788,0.0004502349,0.00007556294,0.0002323936,0.0005603906,0.005301783,0.007539386],"genre_scores_gemma":[0.08788931,0.0002220262,0.9041546,0.0001002015,0.00005762698,0.000319,0.002000331,0.0006613217,0.004595556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02025615,"threshold_uncertainty_score":0.06776363,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04063933733960268,"score_gpt":0.2917432874052786,"score_spread":0.2511039500656759,"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."}}