{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002845519,0.0008352101,0.001012614,0.001187671,0.0005721273,0.001814045,0.001018831,0.0006536209,0.01048724],"category_scores_gemma":[0.002346782,0.000424079,0.0006625392,0.000955046,0.0008614952,0.001901632,0.002204486,0.00137101,0.001792336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007111351,"about_ca_system_score_gemma":0.0007031997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002037643,"about_ca_topic_score_gemma":0.003663749,"domain_scores_codex":[0.9996427,0.00003136962,0.00001660012,0.00006094955,0.0001871097,0.00006132784],"domain_scores_gemma":[0.9990533,0.0004939871,0.00005831367,0.0001594446,0.0001508112,0.00008416433],"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.001108158,0.0002159727,0.003757749,0.0008279677,0.00008081101,0.0006033191,0.0009609335,0.2519416,0.04528686,0.1884692,0.01448503,0.4922625],"study_design_scores_gemma":[0.00004558931,0.0001261441,0.0008292168,0.00003947666,0.00001970894,0.0001468004,0.0002619816,0.8913324,0.0116163,0.08764958,0.007907456,0.00002544481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1361342,0.000158784,0.8465896,0.0001504241,0.00008052644,0.00009347995,0.0006902203,0.002239907,0.0138629],"genre_scores_gemma":[0.5156483,0.0001618199,0.4721621,0.00004130185,0.00003865051,0.00007340885,0.001910883,0.0006987876,0.009264773],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01048724,"threshold_uncertainty_score":0.03508329,"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."}}