{"id":"W402333417","doi":"10.1007/978-3-319-09955-2_11","title":"Efficient Computation of the Outer Hull of a Discrete Path","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Intersection (aeronautics); Convex hull; Path (computing); Hull; Algorithm; Traverse; Plane (geometry); Computation; Data structure; Mathematics; Code (set theory); Time complexity; Space (punctuation); Linear space; Computer science; Regular polygon; Topology (electrical circuits); Geometry; Combinatorics; Engineering","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.0007592216,0.0003541082,0.0005294218,0.0003453665,0.0001506004,0.0001159606,0.003370172,0.0001886697,0.000005058452],"category_scores_gemma":[0.0000598035,0.0002308629,0.0001865899,0.0004757931,0.0007641548,0.0001234448,0.00248571,0.0004322742,0.000005683327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008268953,"about_ca_system_score_gemma":0.0002749247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003109307,"about_ca_topic_score_gemma":0.000008885721,"domain_scores_codex":[0.9968083,0.0000627146,0.0006587963,0.0009154591,0.001199601,0.000355159],"domain_scores_gemma":[0.9970835,0.000299738,0.0007050557,0.001531331,0.0002964047,0.0000839217],"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.000008274109,0.00004545346,0.00007111719,0.0001251521,0.00001274432,0.000008872284,0.001014738,0.4449303,0.0004026409,0.02507088,0.00004111891,0.5282687],"study_design_scores_gemma":[0.0002154255,0.0001228841,0.0004406042,0.0008251939,0.000007949955,0.00001674217,1.202532e-7,0.9705687,0.001375782,0.02589897,0.0002570289,0.0002706012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005059853,0.0001811394,0.9965271,0.0002560307,0.001488409,0.0003292373,0.00001596986,0.00003669418,0.0006594754],"genre_scores_gemma":[0.7178171,0.000006582479,0.2816005,0.0003074419,0.0001650197,0.000003161712,0.000004189416,0.00001966849,0.00007629345],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7173111,"threshold_uncertainty_score":0.9414316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01068428242055411,"score_gpt":0.2357371403730267,"score_spread":0.2250528579524726,"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."}}