{"id":"W2102170762","doi":"10.20382/jocg.v2i1a3","title":"Delaunay triangulation of imprecise points, preprocess and actually get a fast query time","year":2010,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Delaunay triangulation; Computer science; Constrained Delaunay triangulation; Triangulation; Bowyer–Watson algorithm; Pitteway triangulation; Point set triangulation; Artificial intelligence; Algorithm; Mathematics; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007962249,0.001132291,0.001809438,0.001463233,0.0009186495,0.001738741,0.001837635,0.001189679,0.007105445],"category_scores_gemma":[0.0058335,0.0009935478,0.0009557788,0.002215229,0.0008897125,0.003517248,0.002557142,0.001277426,0.004344038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005912613,"about_ca_system_score_gemma":0.000906783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003397817,"about_ca_topic_score_gemma":0.003627715,"domain_scores_codex":[0.9982446,0.0002241259,0.0001404958,0.0003882406,0.0008666462,0.0001357601],"domain_scores_gemma":[0.9969694,0.0008684515,0.0002411813,0.00120663,0.0006228194,0.00009169283],"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":[0.0005951506,0.0001176464,0.001936476,0.0005241935,0.0001020743,0.0004812791,0.0006871937,0.07682931,0.08948958,0.01331478,0.01069689,0.8052254],"study_design_scores_gemma":[0.0002239383,0.0005896192,0.003119936,0.0001104179,0.000125217,0.002153482,0.0008613249,0.7482848,0.144767,0.04354333,0.05602371,0.0001972566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01510564,0.0002794359,0.9816828,0.000129064,0.00005904096,0.00008320125,0.0001008717,0.001737713,0.0008222365],"genre_scores_gemma":[0.07447015,0.000247753,0.9226873,0.00008295212,0.00005804936,0.0001251743,0.0004263098,0.0003933276,0.001508948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007105445,"threshold_uncertainty_score":0.02377009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0047364920417147,"score_gpt":0.1985808638164776,"score_spread":0.1938443717747629,"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."}}