{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007098241,0.0006428529,0.0007560115,0.0009679133,0.0003227473,0.0003879222,0.001930726,0.0002554829,0.00002083288],"category_scores_gemma":[0.00006095966,0.0005552468,0.0001438061,0.0009847374,0.0006070806,0.0004783918,0.0003852636,0.0006499219,0.00001448492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004907496,"about_ca_system_score_gemma":0.0008429055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001858164,"about_ca_topic_score_gemma":0.00007758142,"domain_scores_codex":[0.9954169,0.00004170693,0.0006986805,0.001563192,0.001633399,0.0006461004],"domain_scores_gemma":[0.9971548,0.0005035363,0.0006138575,0.001178617,0.0003414642,0.0002076718],"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.0001758862,0.0001577923,0.00009709827,0.00007719862,0.00004615873,0.0001824293,0.001113695,0.1059829,0.0009449216,0.2309424,0.00005171969,0.6602279],"study_design_scores_gemma":[0.002865761,0.004388036,0.001585035,0.002744329,0.00005101831,0.0002946222,0.000001823912,0.7135517,0.0226217,0.2430972,0.006433635,0.002365182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001716739,0.0004792415,0.9927168,0.0009199358,0.0008504805,0.0006406934,0.00001229374,0.0001042868,0.002559497],"genre_scores_gemma":[0.8117125,0.00003402742,0.1847087,0.00213601,0.0003690075,0.00001423288,0.00002587956,0.00003365499,0.0009659774],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8099958,"threshold_uncertainty_score":0.9996899,"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."}}