{"id":"W1670665503","doi":"10.1007/978-3-540-74472-6_4","title":"On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Convex polygon; Polygon (computer graphics); Combinatorics; Rectilinear polygon; Polygon covering; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Convex set; Mathematics; Star-shaped polygon; Line (geometry); Computer science; Geometry; Convex optimization","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.0007724804,0.001206648,0.001981012,0.00169113,0.00125242,0.002282898,0.002443659,0.002263453,0.008811067],"category_scores_gemma":[0.007043247,0.00108334,0.001277593,0.00256025,0.002487897,0.003158123,0.003462902,0.002747438,0.001021562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008700201,"about_ca_system_score_gemma":0.0004500285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950619,"about_ca_topic_score_gemma":0.002371256,"domain_scores_codex":[0.9993686,0.000160127,0.00003433017,0.0001069942,0.000252503,0.00007759239],"domain_scores_gemma":[0.9971966,0.002081649,0.0002202781,0.0001980376,0.000180455,0.0001230253],"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.0006772996,0.0001951315,0.002049086,0.000833308,0.00008407584,0.0006144199,0.001222222,0.44239,0.01205374,0.3636085,0.009798843,0.1664734],"study_design_scores_gemma":[0.00005646662,0.0001827264,0.0007599887,0.0001434568,0.00003471239,0.0003780332,0.0003809152,0.6445016,0.002359398,0.3437479,0.007413279,0.00004157763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09234258,0.0006286766,0.8770186,0.0005501271,0.0001425965,0.0002309356,0.0002960457,0.0002572354,0.0285332],"genre_scores_gemma":[0.3366741,0.001774973,0.6343663,0.0002043785,0.0002506185,0.0004050081,0.001365655,0.0007446681,0.02421425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008811067,"threshold_uncertainty_score":0.02947593,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02929763025960487,"score_gpt":0.2682825928223587,"score_spread":0.2389849625627538,"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."}}