{"id":"W2120324771","doi":"10.1016/j.tcs.2011.04.019","title":"A linear time and space algorithm for detecting path intersection in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>d</mml:mi></mml:mrow></mml:msup></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Intersection (aeronautics); Initialization; Algorithm; Path (computing); Dimension (graph theory); Mathematics; Linear space; Data structure; Time complexity; Computer science; Discrete mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.001451856,0.002438256,0.001627592,0.004410553,0.001977002,0.003759074,0.003543975,0.002177872,0.03090572],"category_scores_gemma":[0.006975184,0.0008403711,0.001692173,0.004383046,0.001331135,0.004295948,0.003043299,0.002445904,0.009595045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00219721,"about_ca_system_score_gemma":0.004750612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01496854,"about_ca_topic_score_gemma":0.02449514,"domain_scores_codex":[0.9975283,0.0003443405,0.0002203883,0.0007164224,0.0009158744,0.0002747233],"domain_scores_gemma":[0.9967435,0.001760095,0.0002346988,0.000553821,0.0005233071,0.0001846708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007734385,0.0004410012,0.001377075,0.0005828763,0.0001497763,0.0002001832,0.0002907709,0.03766296,0.01322587,0.02473342,0.04447063,0.876092],"study_design_scores_gemma":[0.0005495506,0.0005808696,0.001950969,0.0001211113,0.00016942,0.0009580388,0.0006823498,0.8407074,0.03062294,0.08581724,0.03767016,0.0001699622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008390922,0.000484069,0.9714149,0.0004904734,0.0001645422,0.0003271856,0.0008141331,0.01266779,0.00524603],"genre_scores_gemma":[0.04542562,0.0002298236,0.9443609,0.0001233167,0.00006954546,0.0003737082,0.002652686,0.0005542847,0.006210154],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03090572,"threshold_uncertainty_score":0.1033899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01786933341249639,"score_gpt":0.2459524861509343,"score_spread":0.2280831527384379,"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."}}