{"id":"W2051728965","doi":"10.1007/s00454-013-9521-1","title":"Computing Cartograms with Optimal Complexity","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Berlin; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Hamiltonian path; Planar graph; Planar; Combinatorics; Polygon (computer graphics); Time complexity; Polygonal chain; Discrete mathematics; Graph; Regular polygon; Geometry; Computer science","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.000470736,0.0009214007,0.001431774,0.001596,0.0007421329,0.002278158,0.001262169,0.001174179,0.01182947],"category_scores_gemma":[0.006345767,0.0009329142,0.001146042,0.002217973,0.0009893813,0.002913242,0.002204777,0.001374061,0.002153106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007542234,"about_ca_system_score_gemma":0.001164656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111047,"about_ca_topic_score_gemma":0.006537626,"domain_scores_codex":[0.999414,0.0001037772,0.00003595166,0.0001158773,0.0002500149,0.00008037411],"domain_scores_gemma":[0.998159,0.001080844,0.00008233604,0.0003929513,0.0001988228,0.00008602483],"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.0003954744,0.0001218313,0.001586727,0.0004284226,0.0001166876,0.0002789205,0.0002174073,0.4707158,0.008213422,0.1304644,0.01977306,0.3676879],"study_design_scores_gemma":[0.00006684012,0.00004734452,0.0002481754,0.00002202745,0.00002766896,0.0001090804,0.000076861,0.87161,0.002777807,0.1199996,0.005001384,0.00001305229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05334016,0.0004653735,0.932205,0.0005339626,0.0001877063,0.0001091419,0.0004937323,0.002450247,0.01021468],"genre_scores_gemma":[0.2837401,0.000485042,0.7083703,0.0001576425,0.0001199457,0.0001186273,0.00103222,0.0008856803,0.00509035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01182947,"threshold_uncertainty_score":0.03957349,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01722231830427899,"score_gpt":0.2491749199382125,"score_spread":0.2319526016339335,"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."}}