{"id":"W2137815516","doi":"10.1007/978-3-642-03367-4_20","title":"Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba; University of Toronto; University of Waterloo","funders":"","keywords":"Hausdorff distance; Hausdorff space; Polygon covering; Polygon (computer graphics); Rectilinear polygon; Combinatorics; Mathematics; Regular polygon; Krein–Milman theorem; Monotone polygon; Core (optical fiber); Bounded function; Discrete mathematics; Simple polygon; Convex set; Computer science; Convex optimization; Geometry; Mathematical analysis","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.001861649,0.001376717,0.002990441,0.002520966,0.001121555,0.003115835,0.002955706,0.001658523,0.003301038],"category_scores_gemma":[0.01388493,0.001486688,0.001512657,0.002268815,0.004166015,0.008272361,0.00691733,0.003413811,0.0006763961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395423,"about_ca_system_score_gemma":0.0006588905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001921822,"about_ca_topic_score_gemma":0.001248416,"domain_scores_codex":[0.9983478,0.0004386118,0.0001041026,0.0003921916,0.000583448,0.0001339343],"domain_scores_gemma":[0.9925248,0.004964486,0.0005261191,0.0007615261,0.0007404624,0.0004826573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003390851,0.0001077469,0.001997702,0.0006028645,0.00006913026,0.0005850618,0.00159914,0.1109523,0.01014984,0.7752966,0.006157159,0.09214342],"study_design_scores_gemma":[0.00002342434,0.0001288291,0.0007616433,0.0001184707,0.00003924346,0.0003468309,0.0003357142,0.5668543,0.006311876,0.4178131,0.007209647,0.00005696364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04038944,0.0007677741,0.9514528,0.0002590844,0.00004862075,0.00007983812,0.0001304529,0.0002206216,0.006651503],"genre_scores_gemma":[0.3977613,0.001385215,0.5900305,0.0002308801,0.0002628045,0.0002996186,0.001099263,0.0008005178,0.008130071],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003301038,"threshold_uncertainty_score":0.01104301,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01974554928092759,"score_gpt":0.2506112155265209,"score_spread":0.2308656662455933,"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."}}