{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000168219,0.0000510007,0.00007714167,0.00004781998,0.00002759216,0.00001862457,0.000365958,0.00001992686,0.00001370465],"category_scores_gemma":[0.00007445458,0.00004482062,0.00002316453,0.0002239584,0.00002022727,0.0001519945,0.00004629572,0.00004549685,0.00002910053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001145493,"about_ca_system_score_gemma":0.00005483368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002738492,"about_ca_topic_score_gemma":3.184487e-7,"domain_scores_codex":[0.9994295,0.00003003037,0.0001121721,0.0001462368,0.0001312856,0.0001507875],"domain_scores_gemma":[0.9995052,0.00005081907,0.00003632523,0.0003335775,0.00002718244,0.0000468577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[9.597417e-7,0.00009962545,0.00701811,0.00002435,0.0000265597,0.0001118361,0.001493344,0.005166302,0.04034956,0.9277089,0.001236506,0.01676391],"study_design_scores_gemma":[0.0009694864,0.0002911676,0.008590352,0.0001544411,0.00001292658,0.0006045367,0.0001955527,0.6755144,0.2822457,0.02579348,0.004720544,0.0009073461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003607537,0.0000335654,0.9579239,0.0001186076,0.0001566826,0.00003290897,3.954744e-7,0.00009321586,0.03803315],"genre_scores_gemma":[0.3804767,8.409717e-7,0.6187991,0.00006314069,0.000005236536,0.000001220011,8.232394e-8,0.000001911631,0.0006516956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9019154,"threshold_uncertainty_score":0.1827732,"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."}}