{"id":"W2155070046","doi":"10.1142/s021819590900312x","title":"ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Convex polygon; Polygon (computer graphics); Mathematics; Polygon covering; Rectilinear polygon; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Star-shaped polygon; Line (geometry); Convex set; Geometry; Computer science; Convex optimization","routes":{"ca_aff":true,"ca_fund":true,"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.0006413049,0.001543086,0.001755175,0.001878179,0.001218518,0.001712652,0.002310551,0.001468883,0.007537022],"category_scores_gemma":[0.004827064,0.0008474716,0.001087343,0.003305679,0.001644671,0.002890548,0.002930554,0.001243271,0.001767089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007716693,"about_ca_system_score_gemma":0.0008644406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003414121,"about_ca_topic_score_gemma":0.004745101,"domain_scores_codex":[0.998984,0.0001435357,0.00004802369,0.0001801726,0.0005190309,0.00012525],"domain_scores_gemma":[0.9978772,0.001240788,0.0002699069,0.0002433265,0.0002844046,0.00008434366],"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.0006799155,0.0002278551,0.002535638,0.0008735309,0.0001071545,0.0009068652,0.0006718945,0.3964384,0.02474569,0.03145508,0.007801159,0.5335568],"study_design_scores_gemma":[0.0001209453,0.0002276162,0.0008965307,0.00008095159,0.00004738009,0.0005792386,0.000367674,0.9431855,0.01432679,0.03280038,0.007308661,0.000058252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02709275,0.0002197298,0.9664586,0.000142584,0.00004017173,0.0002326968,0.0001540654,0.0007910554,0.004868439],"genre_scores_gemma":[0.0903866,0.0003313278,0.9059158,0.00004320849,0.00003718193,0.0002140872,0.0004965914,0.0002069511,0.002368265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007537022,"threshold_uncertainty_score":0.0252139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519970402900029,"score_gpt":0.2867783530060181,"score_spread":0.2715786489770178,"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."}}