Call for Papers
31st International Symposium on
Computational Geometry
Eindhoven, June 22-25, 2015
www.win.tue.nl/SoCG2015/
The 31st International Symposium on Computational Geometry will be held in Eindhoven,
the Netherlands, as part of Computational Geometry Week. We invite submissions of
high-quality papers that describe original research on computational problems in a
geometric setting, in particular their algorithmic solutions, implementation issues,
applications, and mathematical foundations. The program committee intends to interpret
the scope of the conference broadly, and will seriously consider all papers that are
of signicant interest to the computational geometry research community. Topics of
interest include, but are not limited to:
* design, analysis, and implementation of geometric algorithms and data structures;
lower bounds on the computational complexity of geometric problems;
* mathematical, numerical, and algebraic issues arising in the formulation, analysis,
implementation, and experimental evaluation of geometric algorithms and heuristics;
discrete and combinatorial geometry; computational topology;
* novel algorithmic applications of geometry in computer graphics, geometric modeling,
computer-aided design and manufacturing, scientic computing, geographic information
systems, database systems, robotics, computational biology, machine learning,
sensor networks, medical imaging, combinatorial optimization, statistical analysis,
discrete dierential geometry, theoretical computer science, graph drawing,
pure mathematics, and other fields.
Important Dates
* November 21, 2014: Paper abstracts (at most 300 words) due (23:59, UTC-12)
* December 1, 2014: Paper submissions due (23:59, UTC-12)
* February 11, 2015: Notication of acceptance/rejection of papers
* March 23, 2015: Final versions of accepted papers due
* June 22-25, 2015: Symposium in Eindhoven
There will be no extension of abstract and paper submission deadlines;
late submissions will not be considered.
Program committee
* Lars Arge (co-chair, MADALGO, Aarhus U.)
* Boris Aronov (NYU Poly)
* Anne Driemel (TU Eindhoven)
* John Hershberger (Mentor Graphics)
* Akitoshi Kawamura (U. Tokyo)
* Stefan Langerman (U. Libre de Bruxelles)
* Kasper Larsen (MADALGO, Aarhus U.)
* Nabil Mustafa (U. Paris-Est, ESIEE Paris)
* Amir Nayyeri (Oregon State U.)
* Janos Pach (co-chair, EPFL & Renyi)
* Marcus Schaefer (DePaul U.)
* Donald Sheehy (U. Connecticut)
* Anastasios Sidiropoulos (Ohio State U.)
* Michiel Smid (Carleton U.)
* Monique Teillaud (INRIA)
* Csaba Toth (Cal State Northridge)
* Antoine Vigneron (KAUST)
* Haitao Wang (Utah State U.)
Publication and Awards
Final versions of accepted papers will be published by LIPIcs (Leibniz International
Proceedings in Informatics) in the symposium proceedings. An author of each accepted
paper will be expected to attend the Symposium and give a presentation (approximately
20 minutes) of the paper. Authors of a selection of papers from the conference will
be invited to submit extended versions of their papers to special issues of one or
two journals, and awards will be given to the best paper and the best student paper.
A best student presentation award will also be given based on the quality of the
presentation of a paper by a student during the conference.
Paper Submission Guidelines
Submissions must be formatted in accordance with the LIPIcs proceedings guidelines
and not exceed 15 pages including title-page and references, but excluding a clearly
marked appendix (further described below). LIPIcs typesetting instructions can be
found at http://www.dagstuhl.de/en/publications/lipics and the lipics.cls LaTeX style
at http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz. Final proceedings
versions of accepted papers must be formatted using the same rules but without the
appendix.
Papers should be submitted in the form of an extended abstract, which begins with the
title of the paper, each author's name and aliation, as well as a short abstract.
This should be followed by the main body of the paper that begins with a precise
statement of the problem considered, a succinct summary of the results obtained
(emphasizing the signicance, novelty, and potential impact of the research), and a
clear comparison with related work. The remainder of the extended abstract should
provide sucient detail to allow the program committee to evaluate the validity,
quality, and relevance of the contribution. Clarity of presentation is very important;
the whole extended abstract should be written carefully, taking into consideration
that it will be read and evaluated by both experts and non-experts, often under tight
time constraints. All details needed to verify the results must be provided, and
supporting materials, including proofs of theoretical claims and experimental details,
that do not fit in the 15-page limit should be given in an appendix. The appendix will
be read by the program committee members at their discretion and will not be
published as part of the proceedings. Thus the paper without the appendix should be
able to stand on its own, but contain all material with the appendix. Submissions
deviating from the above guidelines will be rejected without consideration of
their merits.
Results previously published in another conference proceedings cannot be submitted.
Simultaneous submissions of the results to another conference with published proceedings
are not allowed. Exempted are workshop or conference handouts containing short abstracts.
Results that have already been accepted (with or without revision) for publication by a
journal, at the time of their submission to the conference, will not be allowed. A paper
submitted to a journal but not yet accepted to a journal can be submitted to the
conference. In such cases, the authors must mention this in the submission appendix and
clearly identify the status of the journal submission on November 21, 2014.
Paper Submission
All submissions must be made electronically; see the EasyChair SoCG2015 web page
https://www.easychair.org/conferences/?conf=socg2015 for detailed submission instructions.