{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004317939,0.0001936568,0.0003451183,0.001191519,0.00006845047,0.00007016755,0.001013606,0.00006045976,0.00003640034],"category_scores_gemma":[0.00007796918,0.0001738868,0.0001789487,0.001098245,0.00008282971,0.0004067883,0.00007332063,0.0002123618,0.000007452786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013209,"about_ca_system_score_gemma":0.0002866797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000269766,"about_ca_topic_score_gemma":7.235798e-7,"domain_scores_codex":[0.9972229,0.00006010832,0.001020006,0.0002690474,0.001269171,0.0001587523],"domain_scores_gemma":[0.9955438,0.0005596973,0.00134005,0.0002261056,0.002218319,0.0001120792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004930208,0.001335788,0.0004480133,0.00004033704,0.0005672383,0.00002038713,0.0007529294,0.7482831,0.006383103,0.1113397,0.000432282,0.1299042],"study_design_scores_gemma":[0.01181151,0.009705707,0.02214801,0.001447001,0.000282677,0.002290439,0.0006877462,0.4141492,0.05202299,0.4752393,0.008692331,0.001523055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1568893,0.0001136926,0.8406478,0.001412769,0.0002086168,0.0002432987,0.00003476371,0.00001908522,0.0004306742],"genre_scores_gemma":[0.9343442,0.0000129761,0.06488612,0.0004148899,0.0002207609,0.00001368247,0.00004725255,0.000009010726,0.00005110416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7774549,"threshold_uncertainty_score":0.7090898,"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."}}