{"id":"W2127682860","doi":"10.1109/ccece.1993.332256","title":"A fast distance approximation algorithm for encoded quadtree locations","year":2002,"lang":"en","type":"article","venue":"","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Euclidean distance; Function (biology); Integer (computer science); Approximation error; Algorithm; Computer science; Plane (geometry); Euclidean space; Domain (mathematical analysis); Euclidean geometry; Approximation algorithm; Distance transform; Quadtree; Distance measures; Mathematics; Distance measurement; Combinatorics; Discrete mathematics; Artificial intelligence; Mathematical analysis; Image (mathematics); 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.00008946831,0.00008888377,0.00008004378,0.00006458084,0.00009532632,0.0004253549,0.0005765496,0.00002881369,0.000009304526],"category_scores_gemma":[0.00004094906,0.00008200428,0.00003628082,0.0002853311,0.00003854317,0.001520832,0.00007782804,0.00003570021,0.00004012821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003388506,"about_ca_system_score_gemma":0.00001294454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003686198,"about_ca_topic_score_gemma":0.000004665343,"domain_scores_codex":[0.9992591,0.000007832237,0.0001585498,0.0002646084,0.0001411257,0.0001688014],"domain_scores_gemma":[0.9993379,0.00004604973,0.00006041906,0.0003732241,0.0001386241,0.00004384612],"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":[1.728359e-7,0.00007681941,0.00000285979,0.00001047077,0.000002163101,3.516909e-7,0.0001614363,0.000003041547,0.00009271393,0.06764473,0.005791915,0.9262133],"study_design_scores_gemma":[0.00009415405,0.00003058888,0.0000057305,0.00001332606,0.000001618126,0.000004039505,0.00001118458,0.945101,0.008629934,0.04180921,0.004178697,0.0001205682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000006155876,0.00006547828,0.9687049,0.0009059325,0.00004534518,0.0002322091,0.000004786098,0.0009007049,0.02913447],"genre_scores_gemma":[0.04054256,0.000003645371,0.9544533,0.0002066705,0.00002155827,0.0001716267,0.000004801591,0.000007692764,0.004588116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9450979,"threshold_uncertainty_score":0.4101707,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0259317898117541,"score_gpt":0.2584523675140316,"score_spread":0.2325205777022775,"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."}}