Proceedings of the twenty-ninth annual symposium on Computational geometry
Notice bibliographique
Résumé
This volume contains the research papers, short descriptions of video/multimedia presentations, and summaries of two invited talks, which constitute the technical proceedings of the 29th Annual Symposium on Computational Geometry, to be held at the Universidade Federal do Rio de Janeiro, June 17-20, 2013. There were 137 paper submissions (with 1 withdrawn) among which the program committee selected 48 papers for presentation at the conference. The selection process mainly consisted of two phases. In the initial phase, the program committee produced reviews for each submitted paper. In many cases, program committee members called upon external subreviewers for assistance. In the deliberation phase, which lasted from January 17 to February 13, the program committee discussed the submitted papers and their reviews extensively, obtaining additional input from experts in some cases. The on-line submission process and the review and deliberation phases were conducted using the electronic tools provided by EasyChair. We acknowledge that the entire process, from paper submission to final notification of decisions, was aided significantly by this system. In addition to the paper submissions, six contributions were submitted in response to the Call for Videos and Multimedia. Four of them were videos, visualizing and explaining algorithms and combinatorial theorems. The remaining two were interactive tools to explore and understand different subjects. All contributions were reviewed by the program committee, and after requesting improved versions for a second round of reviews in one case, five were accepted for presentation. These proceedings contain a short, 2-page description for each of the accepted contributions. The full versions, four videos and one video/tool pair, will be archived at www.computational-geometry.org. In many cases, the papers in these proceedings do not contain full details of the proofs of all results claimed, due to the page limit for regular submissions. We hope that most of these papers will later appear with full details in refereed journals. We continue the initiative, started last year, to confer a Best Paper award and a Best Student Presentation award. The program committee selected A Simple Aggregative Algorithm for Counting Triangulations of Planar Point Sets and Related Problems by Victor Alvarez and Raimund Seidel for the Best Paper award. The Best Student Presentation award will be determined at the symposium based on input from the attendees. Student speakers must be authors or co-authors of the papers they present. We note that again this year, the symposium is being held in the mornings over a 4-day period, along with an afternoon series of geometry related events to welcome a broader group of participants, including graduate students and those working in areas where mutual interaction with computational geometry could prove fruitful.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,001 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».