{"id":"W2769373697","doi":"10.1007/978-3-319-71147-8_5","title":"Touring Convex Polygons in Polygonal Domain Fences","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Regular polygon; Polygon (computer graphics); Point in polygon; Path (computing); Plane (geometry); Rectilinear polygon; Disjoint sets; Sequence (biology); Domain (mathematical analysis); Star-shaped polygon; Time complexity; Mathematics; Simple polygon; Computer science; Geometry; Convex set; 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.0001234865,0.0004546279,0.000546565,0.000451853,0.0005356669,0.0009657168,0.0008640618,0.0004841999,0.009042352],"category_scores_gemma":[0.0009004561,0.0004424156,0.000471811,0.0006141894,0.0007212806,0.0008041783,0.001566772,0.0010991,0.00153269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005129353,"about_ca_system_score_gemma":0.0003653719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002793274,"about_ca_topic_score_gemma":0.004055576,"domain_scores_codex":[0.9998736,0.00002351411,0.000005157321,0.00002579093,0.00004722424,0.00002473527],"domain_scores_gemma":[0.9998035,0.00007886934,0.00001702408,0.00003411783,0.00003409896,0.00003246162],"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.0002245545,0.00006250848,0.0007500928,0.0005333126,0.00003496931,0.0006118623,0.0007740465,0.4887765,0.01232835,0.3238417,0.02283539,0.1492268],"study_design_scores_gemma":[0.00002827763,0.00006388366,0.0003180378,0.0001004765,0.00001042233,0.0002802772,0.0003637039,0.8116776,0.004275017,0.1365222,0.04633472,0.00002534959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1282651,0.0006366466,0.7884066,0.0003532755,0.0002455517,0.000190491,0.0008466622,0.00117629,0.07987952],"genre_scores_gemma":[0.4780093,0.001456324,0.4292219,0.0001345277,0.00006399771,0.0002056101,0.001876596,0.001380458,0.08765125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009042352,"threshold_uncertainty_score":0.03024966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0185123773682178,"score_gpt":0.2575416937121449,"score_spread":0.239029316343927,"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."}}