{"id":"W4244080821","doi":"10.1145/780611.780612","title":"Touring a sequence of polygons","year":2003,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Simple polygon; Regular polygon; Polygon (computer graphics); Disjoint sets; Path (computing); Sequence (biology); Mathematics; Shortest path problem; Generalization; Time complexity; Point (geometry); Simple (philosophy); Binary logarithm; Point in polygon; Convex polygon; Computer science; Geometry","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.0001778682,0.000666676,0.0004740698,0.0005359695,0.0006910625,0.0009010728,0.000701861,0.0005947652,0.01097853],"category_scores_gemma":[0.001203035,0.0003876782,0.0006947989,0.001094012,0.0006260447,0.001694303,0.0009602965,0.0007150883,0.001380889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007313835,"about_ca_system_score_gemma":0.0008895073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004253633,"about_ca_topic_score_gemma":0.005283677,"domain_scores_codex":[0.9996485,0.00006799672,0.00002966271,0.0001272915,0.00007220936,0.00005439961],"domain_scores_gemma":[0.9996676,0.000119625,0.00004611911,0.00007763937,0.00004249693,0.00004638823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009572786,0.0003192875,0.00717094,0.001306376,0.0001607895,0.001811281,0.001479371,0.4369818,0.04398723,0.1246319,0.04401823,0.3371755],"study_design_scores_gemma":[0.0001485641,0.000519074,0.003298644,0.0001181382,0.00005689216,0.0009011423,0.001198878,0.7925951,0.01469142,0.09988774,0.08650998,0.00007444875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2742139,0.0005961268,0.6701636,0.001305322,0.0002624251,0.001057243,0.007171456,0.003708838,0.04152118],"genre_scores_gemma":[0.4374427,0.0007961763,0.5306135,0.0001889992,0.00005614906,0.0003575813,0.009475884,0.0003061199,0.02076282],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01097853,"threshold_uncertainty_score":0.03672683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04010925928203262,"score_gpt":0.2693167653220623,"score_spread":0.2292075060400297,"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."}}