Home

Photo : Sunday, Monday, Tuesday, Wednesday

The 30th Annual Symposium on Computational Geometry (SoCG 2014) will be held in Kyoto University Centennial Memorial Hall, Kyoto, Japan, as part of the Computational Geometry Week. We invite submissions of high-quality papers, videos, and multimedia presentations describing original research addressing computational problems in a geometric setting, in particular their algorithmic solutions, implementation issues, applications, and mathematical foundations. The topics of the Symposium reflect the rich diversity of research interests in computational geometry. They are intended to highlight both the depth and scope of computational geometry, and to invite fruitful interactions with other disciplines. Topics of interest include, but are not limited to:

   


Venue

The conference will take place at Centennial Memorial Hall, Clock Tower Centennial Hall, Kyoto University, Kyoto, Japan.

   



Invited Speakers

  • Marie-Paule Cani ( INRIA ) https://team.inria.fr/imagine/marie-paule-cani/
  • Henry Segerman ( Oklahoma State University) https://www.math.okstate.edu/~segerman/
  • Jin Akiyama ( Keynote for CG week, Tokyo University of Science ) http://jin-akiyama.com/index.html


    Registration

    Registration is now open for SoCG 2014 and Computational Geometry Week.

    Regstration Closed

    Registration fees are as follows:
    Early Registration
    (March 1 - May 10)
    Late Registration
    (May 11 - June 7)
    On-site Registration
    Full Registration Regular 35,000JPY 45,000JPY 45,000JPY
    Student 18,000JPY 23,000JPY 28,000JPY
    1-day Workshop - - 10,000JPY/day

    Full Registration(SoCG2014 + Workshop)

    Early registration deadline is May 10, 2014. Full Registration includes attendance of SoCG conference, all workshops, coffee breaks, banquet, and USB proceedings.

    Student registrants will be asked to show student ID at the registration desk.

    1-day Workshop Registration

    If you would like to attend only workshop, please register as 1-day Workshop. The payment will be made in cash(JPY) on-site at the registration desk.

    Extra Banquet Ticket

    Please contact us (socg2014@dais.is.tohoku.ac.jp).

    Lunch

    On your own.



    Program

    CG Week 2014 Program (booklet)
    Conference Booklet including local information

    Conference venue (Clock Tower Centennial Hall) will be open at 9:00.
    You can enter the building from 9:00.
    Please patiently wait if you arrive early.
    We are sorry for this inconvenience.

    June 8(Sun), 2014

    9:00-
    Registration

    Room Int. Conference Hall 1 Int. Conference Hall 2 Int. Conference Hall 3
    9:30-11:10
    Session 1a

    Session 1b
    11:10-11:30 Coffee Break
    11:30-12:55

    Sesson 2
    Invited Talk : Henry Segerman

    Best Paper Award

    Room : 1F Centennial Hall

    12:55-14:30 Lunch (On your own)
    14:30-16:00 Geometric Structures with Symmetry and Periodicity Geometric Optimization in Wireless Communication and Sensing
    Video Sesson
    (14:30-15:30)

    YRF Fast Forward
    (15:30-16:00)

    16:00-16:30 Coffee Break
    16:30-18:00
    Geometric Structures with Symmetry and Periodicity


    Geometric Optimization in Wireless Communication and Sensing


    Young Researchers Forum Session 1



    June 9(Mon), 2014

    9:00-
    Registration

    Room Int. Conference Hall 1 Int. Conference Hall 2 Int. Conference Hall 3
    9:15-10:55
    Session 3a

    Session 3b Session 3c
    10:55-11:15 Coffee Break
    11:15-12:30
    Session 4a

    Session 4b Session 4c
    12:30-13:30 Lunch (On your own)
    13:30-14:30
    CG Week Plenary Talk : Jin Akiyama

    Room : 1F Centennial Hall

    14:30-15:00 Coffee Break
    15:00-16:20
    Geometric Structures with Symmetry and Periodicity


    Extension Complexity: An Update and Future Directions


    Young Researchers Forum Session 2
    (15:00-16:30)

    16:20-16:40 Coffee Break
    16:40-18:00
    Geometric Structures with Symmetry and Periodicity


    Extension Complexity: An Update and Future Directions

    18:45-21:00
    Business Meeting

    Room : Int. Conference Hall 1,2




    June 10(Tue), 2014

    9:00-
    Registration

    Room Int. Conference Hall 1 Int. Conference Hall 2 Int. Conference Hall 3
    9:15-10:55
    Session 5a

    Session 5b
    10:55-11:15 Coffee Break
    11:15-12:15
    Sesson 6
    Invited Talk : Marie-Paule Cani

    Room : 1F Centennial Hall

    12:15-13:30 Lunch (On your own)
    13:30-14:20
    Session 7a

    Session 7b Session 7c
    14:20-14:30 Coffee Break
    14:30-16:10
    Geometric Puzzles and Games


    Triangulations in Geometry and Topology

    16:10-16:30 Coffee Break
    16:30-18:00
    Geometric Puzzles and Games


    Triangulations in Geometry and Topology

    19:00-21:00
    Banquet

    Place : Kyoto Royal Hotel & SPA




    June 11(Wed), 2014

    9:00-
    Registration

    Room Int. Conference Hall 1 Int. Conference Hall 2
    9:15-10:55
    Session 8a

    Session 8b
    10:55-11:15 Coffee Break
    11:15-12:55
    Session 9a

    Session 9b
    12:55-14:30 Lunch (On your own)
    14:30-16:10
    Workshop in Honor of 65th Birthday of Tetsuo Asano: Growing Collaboration in Computational Geometry

    16:10-16:30 Coffee Break
    16:30-18:35
    Workshop in Honor of 65th Birthday of Tetsuo Asano: Growing Collaboration in Computational Geometry


    Workshops in CG Week 2014

    Satellite Workshop


    Important Dates

    • November 22, 2013: Paper titles and abstracts (at most 300 words) due (23:59, UTC-12)
    • December 3, 2013: Paper submissions due (23:59, UTC-12)
    • February 14, 2014: Notification of acceptance/rejection of papers
    • March 24, 2014: Final versions of accepted papers due
    • June 8-11, 2014: Symposium in Kyoto


    Call for Papers(pdf)

    The 30th Annual Symposium on Computational Geometry (SoCG) will be held in Kyoto, Japan, 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. 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, scientific computing, geographic information systems, database systems, robotics, computational biology, machine learning, sensor networks, medical imaging, combinatorial optimization, statistical analysis, discrete differential geometry, theoretical computer science, graph drawing, pure mathematics, and other fields.

    Publication and Awards

    Final versions of accepted papers will be published by ACM in the symposium proceedings. Proceedings will be distributed to symposium participants and will also be available from ACM for purchase and through the ACM digital library. 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 a special issue of one or two journals. We plan to confer a Best Paper Award and a Best Student Presentation Award. The Student Presentation award will be based on the quality of the presentation of a paper by a student during the conference. The authors of the Best Paper Award will be invited to submit their work to the Journal of the ACM.



    Paper Submission

    All submissions must be made electronically; see the EasyChair SoCG2014 web page (https://www.easychair.org/conferences/?conf=socg2014) for detailed submission instructions.


    Submission Guidelines

    Papers should be submitted in the form of an extended abstract, which begins with the title and abstract page that contains the title of the paper, each author's name, affiliation, and e-mail address followed by a short abstract. Authors can add on this title page a special section containing any remarks for the program committee (journal submission, conflict of interest...). The main body of the extended abstract should begin with a precise statement of the problem considered, a succinct summary of the results obtained (emphasizing the significance, novelty, and potential impact of the research), and a clear comparison with related work. The remainder of the extended abstract should provide sufficient 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.
      Submissions should be typeset in single column format, using 11-point or larger font, with at least 1 inch/2.54 cm margins and single line spacing. Excluding the title page and bibliography, the extended abstract must not exceed 10 pages. Submissions deviating from these guidelines risk rejection without consideration of their merits. If possible, lines should be numbered (e.g. using lineno latex package).
      All necessary details to verify the results must be provided. If they cannot fit within the 10-page limit, a clearly marked appendix containing omitted details should be included. Appendices are not counted in the 10 page limit, so while they may serve as a reference, they will be read by the program committee members at their discretion. The paper excluding the appendix should clearly describe the results and the approach to achieve them, and give sufficient confidence for their validity. The appendix should then give all the necessary details to verify correctness.
      Anticipating the usual high overall quality of submissions, the program committee intends to interpret the scope of the conference broadly, and will seriously consider all papers that are of significant interest to our research community.
      Authors must submit the title and an abstract (at most 300 words) of their papers by November 22, 2013 (23:59, UTC-12). This pre-submission will be used to help make program committee reading assignments. Extended abstracts must be received by December 3, 2013 (23:59, UTC-12). There will be no extension of these deadlines; late submissions will not be considered. Authors will be notified of acceptance or rejection by February 14, 2014; reviews will be sent by February 21, 2014. The final proceedings papers must be formatted in accordance with ACM proceedings guidelines. They are due on March 24, 2014. LaTeX style files will be made available to authors of accepted papers.
      Results previously published in another conference proceedings cannot be submitted to SoCG. Simultaneous submissions of the results to another conference with published proceedings are not allowed. Exempted are workshop or conference handouts containing short abstracts not exceeding four pages in length. Results that have already been accepted (with or without revision) for publication by a journal, at the time of their submission to SoCG, will not be allowed. A paper submitted to a journal but not yet accepted to a journal can be submitted to SoCG. In such cases, the authors must mention it in page zero, the title and abstract page, and include the full journal version in an appendix that clearly identifies the status of the journal submission on November 22, 2013.

    For questions regarding SoCG submissions:


    SoCG 2014 Accepted Papers(pdf)

    Marek Elias, Jiri Matousek, Edgardo Roldan-Pensado and Zuzana Safernova. Lower bounds on geometric Ramsey functions
    Imre Barany, Jiri Matousek and Attila Por. Curves in R^d intersecting every hyperplane at most d+1 times
    Tal Kaminker and Micha Sharir. Finding the Largest Disk Containing a Query Point in Logarithmic Time with Linear Storage
    Hiba Abdallah and Quentin Merigot. On the reconstruction of convex sets from random normal measurements
    Ulrich Bauer, Xiaoyin Ge and Yusu Wang. Measuring Distance between Reeb Graphs
    Frederic Chazal, Brittany Terese Fasy, Fabrizio Lecci, Alessandro Rinaldo and Larry Wasserman. Stochastic Convergence of Persistence Landscapes and Silhouettes
    Ulrich Bauer and Herbert Edelsbrunner. The Morse theory of ?ech and Delaunay filtrations
    Frederic Chazal and Jian Sun. Gromov-Hausdorff Approximation of Filament Structure Using Reeb-type Graph
    Sariel Har-Peled and Benjamin Raichel. On the Complexity of Randomly Weighted Voronoi Diagrams
    Adrian Dumitrescu and Minghui Jiang. THE OPAQUE SQUARE
    Sariel Har-Peled. Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
    Luis Barba, Jean Lou De Carufel, Otfried Cheong, Michael Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, Janos Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot and Tianhao Wang. Weight Balancing on Boundaries and Skeletons
    Jiri Matousek, Eric Sedgwick, Martin Tancer and Uli Wagner. Embeddability in the 3-sphere is decidable
    Pedro Machado Manhaes de Castro, Quentin Merigot and Boris Thibert. Intersection of paraboloids and application to Minkowski-type problems
    Kevin Verbeek and Subhash Suri. Metric Embedding, Hyperbolic Space, and Social Networks
    Anna Gundert and May Szedlak. Higher Dimensional Cheeger Inequalities
    Ulrich Bauer and Michael Lesnick. Induced Matchings of Barcodes and the Algebraic Stability of Persistence
    Isaac Mabillard and Uli Wagner. Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
    Ljubomir Perkovic, Nicolas Bonichon, Iyad Kanj and Ge Xia. There are Plane Spanners of Maximum Degree 4
    Manuel Wettstein. Counting and Enumerating Crossing-free Geometric Graphs
    Sergio Cabello, Josef Cibulka, Jan Kyncl, Maria Saumell and Pavel Valtr. Peeling potatoes near-optimally in near-linear time
    Sylvester Eriksson-Bique, Valentin Polishchuk and Mikko Sysikaski. Optimal Geometric Flows via Dual Programs
    Janos Pach and Frank de Zeeuw. Distinct distances on algebraic curves in the plane
    Maike Buchin, Anne Driemel and Bettina Speckmann. Computing the Frechet distance with shortcuts is NP-hard
    Hu Ding and Jinhui Xu. Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems
    Micha Sharir and Noam Solomon. Incidences between points and lines in $\reals^4$
    Yair Bartal, Lee-Ad Gottlieb and Ofer Neiman. On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_p$
    Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz and Birgit Vogtenhuber. Linear transformation distance for bichromatic matchings
    Nicolas Chevallier, Augustin Fruchard, Dominique Schmitt and Jean-Claude Spehner. Separation by Convex Pseudo-Circles
    Arnau Padrol and Louis Theran. Delaunay triangulations with disconnected realization spaces
    Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew Katz and Micha Sharir. The Discrete Fr\'echet Distance with Shortcuts via Approximate Distance Counting and Selection
    Suyi Wang, Yusu Wang and Rephael Wenger. Merge Graphs of Join and Split Trees
    Alexandre Rok and Bartosz Walczak. Outerstring graphs are chi-bounded
    Don Sheehy. The Persistent Homology of Distance Functions under Random Projection
    Jeff Erickson and Anastasios Sidiropoulos. A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
    Pankaj K. Agarwal and Jiangwei Pan. Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
    Zachary Abel, Robert Connelly, Sarah Eisenstat, Radoslav Fulek, Filip Mori?, Yoshio Okamoto, Tibor Szabo and Csaba Toth. Free Edge Lengths in Plane Graphs
    Zachary Abel, Erik D. Demaine, Martin Demaine, Jin-Ichi Itoh, Anna Lubiw, Chie Nara and Joseph O'Rourke. Continuously Flattening Polyhedra Using Straight Skeletons
    Andreas Baertschi, Thomas Tschager, Subir Kumar Ghosh, Matus Mihalak and Peter Widmayer. Improved bounds for the conflict-free chromatic art gallery problem
    Sunil Arya and Timothy M. Chan. Better $\varepsilon$-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and $\varepsilon$-Kernels
    Timothy M. Chan and Patrick Lee. On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures
    Lee-Ad Gottlieb and Shay Solomon. Light spanners for snowflake metrics
    Shay Solomon. Euclidean Steiner Shallow-Light Trees
    Bernd Gaertner. Sampling with Removal in LP-type Problems
    Daniel Marx and Anastasios Sidiropoulos. The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems
    Orit E. Raz, Micha Sharir and Jozsef Solymosi. On triple intersections of three families of unit circles
    Orit E. Raz, Micha Sharir and Jozsef Solymosi. Polynomials vanishing on grids: The Elekes-R\'onyai problem revisited
    Ciprian Borcea and Ileana Streinu. Liftings and stresses for planar periodic frameworks
    Sander Alewijnse, Timur Bagautdinov, Mark De Berg, Quirijn Bouts, Alex Ten Brink, Kevin Buchin and Michel Westenberg. Progressive Geometric Algorithms
    Danny Z. Chen, Rajasekhar Inkulu and Haitao Wang. Two-Point L_1 Shortest Path Queries in the Plane
    Cynthia Dwork, Aleksandar Nikolov and Kunal Talwar. Using Convex Relaxations for Efficiently and Privately Releasing Marginals
    Eric Colin de Verdiere, Alfredo Hubard and Arnaud de Mesmay. Discrete systolic inequalities and decompositions of triangulated surfaces
    Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, Andre van Renssen, Perouz Taslakian, Sander Verdonschot and Ge Xia. New and Improved Spanning Ratios for Yao Graphs
    Tamal Dey, Fengtao Fan and Yusu Wang. Computing Topological Persistence for Simplicial Maps
    Quirijn Bouts, Alex Ten Brink and Kevin Buchin. A Framework for Computing the Greedy Spanner
    Alexander Munteanu, Christian Sohler and Dan Feldman. Smallest enclosing ball for probabilistic data
    Ioannis Emiris and Vissarion Fisikopoulos. Efficient Random-Walk Methods for Approximating Polytope Volume
    Andrea Francke and Csaba Toth. A Census of Plane Graphs with Polyline Edges
    Arturs Backurs and Piotr Indyk. Better embeddings for planar Earth-Mover Distance over sparse sets
    Jonathan Shewchuk and Hang Si. Higher-Quality Tetrahedral Mesh Generation for Domains with Small Angles by Constrained Delaunay Refinement



    Call for Videos and Multimedia Presentations (pdf)

    part of 30th Annual Symposium on Computational Geometry (SoCG 2014)
    June 8-11, 2014
    Kyoto, Japan

    Video and multimedia presentations are sought for the 23rd Annual Video and Multimedia Review of Computational Geometry, to accompany the 30th Annual Symposium on Computational Geometry. This review showcases the use of visualization in computational geometry for exposition and education, for visual exploration of geometry in research, and as an interface and a debugging tool in software development. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, demonstrations of software systems, and games that illustrate concepts from computational geometry are all appropriate. There are no limitations on creativity, anything that leverages the possibilities of multimedia to enlighten and entertain the viewer while learning about computational geometry will do. This includes rendered animation, films with narrators and/or actors, and interactive stories.

    We seek submissions of high quality, judged by how well they exploit the creative possibilities of their respective formats. That is, a screencast of static slides with some voice-over will hardly do.


    QUALITY ISSUES

    The "formatting" for Video and Multimedia submissions is more influential on the acceptance than for paper submission. For videos, a length of three to five minutes is usually ideal; ten minutes is the upper limit. For the final version, we require video in 720P or better, using H.264. The embedded audio stream should be AAC of at least 128kBit/s. Telephone-sounding audio (limited frequency range, noise) or live rooms, as often recorded with cheap headsets, must be avoided, as well as speakers with too heavy accent.

    For other content, there can be no guidelines on how to submit. Interactive applications (e.g., HTML5, Flash, AIR, Java, etc.) should provide a "demo" mode where they run by themselves. They should be submitted as a distributable package.

    It is strongly encouraged to contact the Video/MM PC well in advance to 1) discuss the quality of a video submission (based on sample files) or 2) to present your non-video idea and how it could be reviewed, presented, and distributed.


    SUBMISSION

    Submissions should be deposited online where they are accessible through the web or via FTP. A video submission should play trouble-free on programs like VLC Media Player. For ease of sharing and viewing, we encourage (but do not require) that each video submission be uploaded to YouTube, and that the corresponding URL be included with the submission.

    Each submission should include a two-page description of the material shown in the presentation, and where applicable, the techniques used in the implementation. The final two-page descriptions must be formatted according to the guidelines for the conference proceedings. LaTeX style files will be provided to authors of accepted presentations.

    Send a mail to the Video/MM committee chair, Kevin Buchin (k.a.buchin@tue.nl) by February 17, 2014, 23:59 (UTC-12), with the following information:
    - the names and institutions of the authors
    - the email address of the corresponding author
    - instructions for downloading the submission
    - if available: the link to the YouTube video
    - and the PDF abstract.

    We explicitly encourage video/multimedia submissions that support papers submitted to the Symposium. However, submitted papers and associated video/multimedia submissions will be treated entirely separately by the respective committees: acceptance or rejection of one will not influence acceptance or rejection of the other.
    Authors will be notified of acceptance or rejection, and given reviewers' comments, by March 10, 2014. For each accepted submission, the final version of the 2-page textual description will be due by March 24, 2014 for inclusion in the proceedings. Final versions of accepted video/multimedia presentations will be due April 26, 2014.


    IMPORTANT DATES

    February 17, 2014: Video and multimedia submissions due
    March     10, 2014: Notification of acceptance/rejection of videos/multimedia
    March     24, 2014: Camera-ready versions due for papers and video abstracts
    April       26, 2014: Final versions due for videos/multimedia
    June    8-11, 2014: Symposium in Kyoto


    VIDEO AND MULTIMEDIA PRESENTATION PROGRAM COMMITTEE

    Eric Berberich (Max-Planck-Institute for Informatics, Saarbrucken)
    Kevin Buchin (TU Eindhoven, Chair)
    Sunghee Choi (KAIST)
    Wolfgang Mulzer (Free University Berlin)
    Yoshio Okamoto (University of Electro-Communications, Tokyo)
    Andre Schulz (University of Munster)
    Bettina Speckmann (TU Eindhoven)
    Yusu Wang (Ohio State University)




    Call for Workshops (pdf)


    The 30th Symposium on Computational Geometry (SoCG) will take place June 8-11, 2014 in Kyoto, Japan. SoCG brings together the global community of researchers who work on a large variety of topics that combine geometry, topology, algorithms, and applications. Information about the Symposium can be found at http://www.dais.is.tohoku.ac.jp/~socg2014/.

    To allow a broad audience to actively participate in the community's major scientific event, this year's Symposium will again be accompanied by a series of afternoon events; the regular SOCG talks will be scheduled for the mornings. Together, these events will constitute "CG Week 2014".

    One of these afternoon events is WoCG, a series of workshops and minisymposia on topics related to all aspects of computational geometry and its applications.

    Typical events may feature some number of invited speakers and possibly some number of contributed presentations. Events may include other forms of presentations, such as software demos, panel discussions, industry forums, tutorials, posters, videos, implementation challenges, or artwork. WoCG events will have no formal proceedings. Optionally, the organizers may coordinate with journals to publish special issues, or arrange for other dissemination (via arXiv, webpages, or printed booklets, for example). We expect most events to last one afternoon (3-4 hours), but some meritorious events may extend across two afternoons.

    We invite proposals for events focusing on all topics of potential interest to the computational geometry community. Possible topics include (in alphabetical order): algebraic methods, biology, cache-oblivious algorithms, chemistry, combinatorial geometry, computational photography, computational topology, computer graphics, computer vision, conformal geometry, differential geometry, folding/origami, games and puzzles, geographic information systems, geometric aspects of privacy, geometric software, geometry of graphs, geometry processing, high-dimensional geometric algorithms, implementation challenges, machine learning, manufacturing, massive data sets, mesh generation, motion planning, optimization, physical simulation, physics, real-world applications of CG, robotics, sensor networks, surface reconstruction, and visualization.

    Proposals should be submitted by email to the WoCG committee chair, Jeff Erickson (jeffe@illinois.edu), by February 21, 2014. Proposals should be brief (at most 3 typeset pages) and should include the following information:

    1. Title or theme of the workshop/minisymposium/event
    2. Name and email address of the organizer(s)
    3. Brief scientific summary and discussion of merits of the proposed topic to computational geometry
    4. A description of the proposed format and agenda
    5. Proposed duration (both minimum and ideal).
    6. Procedures for selecting participants and presenters
    7. Intended audience
    8. Potential invited speakers/panelists
    9. Plans for dissemination (such as journal special issues)
    10. Past experience of the organizer(s) relevant to the event

    IMPORTANT DATES:

    February  21, 2014: Workshop proposals due
    March       3, 2014: Notification of acceptance/rejection
    June    8-11, 2014: Symposium in Kyoto

    FURTHER INFORMATION:

    We anticipate that WoCG events will be operated at low cost. In particular, there is no intended budget for invited speakers, except as arranged by the individual workshop organizers. SoCG organizers will provide organizational assistance, including registration, meeting rooms at the SoCG venue, coffee breaks, wireless network, and a link to the web page of the event.

    WOCG PROGRAM COMMITTEE:

    Pankaj Agarwal (Duke Universty)
    David Avis (McGill University)
    Sunil Arya (Hong Kong University of Science and Technology)
    Benjamin Burton (University of Queensland)
    Otfried Cheong (Korea Institute of Science and Technology)
    Jeff Erickson (University of Illinois at Urbana-Champaign, chair)
    Stefan Langerman (Universite Libre de Bruxelles)
    Jeff Philips (University of Utah)
    Ryuhei Uehara (Japan Advanced Institute of Science and Technology)




    Computational Geometry: Young Researchers Forum -- Call for Papers(pdf)

    The 30th Symposium on Computational Geometry (SoCG) will take place June 8-11, 2014 in Kyoto, Japan. It brings together the global community of researchers who work on a large variety of aspects that combine geometry, algorithms and applications. To allow a broad audience to actively participate in the community's major scientific event, this year SoCG will again be accompanied by a series of satellite events, which together constitute "CG Week 2014". See http://www.dais.is.tohoku.ac.jp/~socg2014/.

    One of these events will be "Computational Geometry: Young Researchers Forum" (CG:YRF), which is aimed at current and recent students. The active involvement by students and recent graduates in research, discussions, and social events has been longstanding tradition in the CG community. Participation in a top-level event such as SoCG can be educating, motivating, and useful for networking, both with other students and with more senior scientists.

    The YRF presents young researchers an opportunity to present their work (in progress as well as finished results) to the CG community in a friendly, open setting. Just like in the main event, presentations will be given in the form of talks. A pre-screening (but no formal review process) will ensure appropriate quality control.

    The EasyChair submission page is now up at: https://www.easychair.org/conferences/?conf=cgyrf2014.

    SUBMISSION GUIDELINES:

    - The idea of the event is for young researchers to present new and ongoing work. Therefore, the work should not have appeared in print in a formally reviewed proceedings volume or journal by the time of submission.
    - Topics must fit into the general context of SoCG, as described in the call for SoCG submissions.
    - At least one of the authors must be a young researcher (defined as not having received a formal doctorate before 2012) who will present the work during CG:YRF. - A submission must be in the form of a 2-page abstract, formatted according to a provided style file [http://www.staff.science.uu.nl/~loffl001/cgyrf14.cls, example paper(zip)] and submitted via easychair. - Accepted abstracts will be compiled in a booklet of abstracts that will be distributed among the participants; this should not be considered a formal publication. In particular, participants are encouraged to submit (an extended version of) their presented work to a conference with formal proceedings and/or to a journal.


    We will employ a two-phase screening process. After the first review phase, there will be a notification of either rejection (if the result is clearly out of context, or technically incorrect), or conditional acceptance, accompanied with a description of required changes to be made (either with respect to content or format). In the second phase, we will check whether the changes have been implemented satisfactorily. The screening process is intended to ensure the technical quality of the presented work. Submissions that are not well written risk rejection, irrespective of correctness. Authors are requested to have their submissions proofread by their advisor or another experienced scientist.

    After acceptance, appropriate acceptance letters can be provided.

    IMPORTANT DATES(deadlines are 23:59 Honolulu time):

    - March 31, 2014: Deadline for submissions (Extended by April 7)
    - April 21, 2014: Notification of conditional acceptance
    - April 28, 2014: Deadline for revisions
    - May 5, 2014: Notification of acceptance
    - June 8-11, 2014: CG-Week 2014

    YRF PROGRAM COMMITTEE:

    Tetsuo Asano (Japan Advanced Institute of Science and Technology)
    Erin Chambers (Saint Louis University)
    Maarten Loffler (Utrecht University, chair)
    David Mount (University of Maryland)
    Sheung-Hung Poon (National Tsing Hua University)
    Rodrigo Silveira (University of Aveiro and UPC Barcelona Tech)
    Jack Snoeyink (University of North Carolina at Chapel Hill)
    Bettina Speckmann (Technical University Eindhoven)


    Student Travel Support

    NSF Travel Grant

    Limited amount of travel support for students (mainly from US) is available.

    Detail

    Contact Jeff Erickson (jeffe@illinois.edu)

    Support for Asian Students

    Limited amount of travel support for students of Asian institutes/universities who are going to give talks at SOCG or Young Researcher Forum is available.
    Contact (socg2014@dais.is.tohoku.ac.jp)



    Travel and Accommodation Information


    Access from Airport


    Travel to the conferece venue (from Kyoto Station)


  • by Taxi
  • by Bus
       Take Kyoto City Bus Line #206 or #17 at Kyoto station bus terminal.
       It takes approx. 30 minutes. Flat rate fares (230 yen) will be charged.
         # 206: bound for Kitaoji Bus Terminal via Higashiyama St. Get off at "Kyodai Seimon-mae".
         # 17: bound for Ginkaku-ji via Kawaramachi St. Get off at "Hyakumanben".
  • City Bus All-day Pass
        Adult:500 yen, Child:250 yen
        Can be used within the allocated zone of the city.
        Valid within the allocated zone.
        Unlimited use on the same day.
        When traveling outside of the allocated zone, it is necessary to pay the extra amount.
  • Public transport in Kyoto

  • Kyoto Univesity Access Information:
       Getting to Kyoto Universty
       Kyoto University Campus Map
  • Card for Taxi Drivers (pdf)

    Accommodation

    A variety of hotels are located around the Kyoto Station and Kawaramachi.
    http://travel.rakuten.com/
    http://www.jalan.net/en/japan_hotels_ryokan/
    http://www.booking.com/


    Accommodation Information (Recommendable Hotel list)

    Banquet place: Kyoto Royal Hotel & SPA



    Visa Application

    If you need a visa to visit Japan, please take the following steps.

    1. Please first finish the registration and payment.
    2. Please contact the local embassy, and make sure which documents you require for application.
    3. Please contact us and let us know which documents we need to prepare. Please provide us sufficient information.
      Contact address: socg2014@dais.is.tohoku.ac.jp
      Subject: visa application

    As soon as the documents are ready, we will send them to you.
    Note that we need concrete academic background / certificate of an applicant to issue an invitation letter.





    Committees

    Program Committee

    Local Arrangements Committee


    SoCG 2014 and CG Sponsors

    The conference is organized in cooperation with SIGACT and SIGGRAPH:

    ACM

    Siggraph

    Sigact

    We would like to thank supports:

    Tohoku

    Kyoto

    ELC

    Kawarabayashi

    kayamori




    Contact

    • Contact
    • For questions regarding SoCG submissions:




    What's New

  • June 19, 2014
    Home is updated.
  • June 2, 2014
    Program, Travel are updated.
  • May 31, 2014
    Workshops in CG Week 2014 is updated.
  • May 27, 2014
    Workshops in CG Week 2014 is updated.
  • May 19, 2014
    Workshops in CG Week 2014 is updated.
  • May 13, 2014
    Tentative Schedule is updated.
  • May 11, 2014
    Accommodation Information is updated.
  • May 2, 2014
    Tentative Schedule is updated.
  • April 25, 2014
    Workshops in CG Week 2014 is updated.
  • April 21, 2014
    Student Travel Support is updated.
  • April 10, 2014
    SoCG2014 Program is announced.
  • April 2, 2014
    Submission deadline for the Young Researchers Forum has been extended.
  • March 5, 2014
    Tentative Schedule and Workshops in CG Week 2014 are updated.
  • March 1, 2014
    Registration is open.
  • February 14, 2014
    Young Researchers Forum submission is open.
  • February 14, 2014
    Travel and Accommodation Information , Registration , Student Travel Support and VISA Application are updated.
  • February 13, 2014
    SoCG Accepted papers is updated.
  • February 10, 2014
    Call for Young Researchers Forum is updated.
  • January 30, 2014
    Call for Workshops is updated.
  • January 18, 2014
    Call for Videos and Multimedia Presentations is updated.
  • September 11, 2013
    Call for SoCG2014 Papers is updated.