TaiChung, Taiwan


Geometric Constraints and Reasoning

Technical track of the 26th Annual ACM

Symposium on Applied Computing

SAC 2011

21 -25 March 2011

Tunghai University, Taichung, Taiwan


SAC 2011

For the past twenty-two years, the ACM Symposium on Applied Computing (SAC) has been a primary and international forum for applied computer scientists, computer engineers and application developers to gather, interact, and present their work. The ACM Special Interest Group on Applied Computing (SIGAPP) is the sole sponsor of SAC. The conference proceedings are published by ACM and are also available online through ACM's Digital Library.

The 26th Annual SAC meeting will be held 21-25 March 2011 in Taichung (Taiwan) and will be held on the campus of the Tunghai University, Taichung, Taiwan

More information about SIGAPP can be found at http://www.acm.org/sigapp and on past and current SAC events can be found at the URL http://www.acm.org/conferences/sac .


Geometric Computing and Reasoning (GCR) is a recent track of SAC. This year will see its sixth edition. Previous editions were held in Dijon (France), in Seoul (Korea), in Fortaleza (Brazil), Hawaii (USA), and Serre (Switzerland) GCR is devoted to the recent trends in the domain of geometric constraint solving (GCS) and automated, or computer aided, deduction in geometry (ADG). Geometric problems are within the heart of many theoretical studies and engineering applications. For instance, many problems from geometric modeling, computer graphics, computer vision, computer aided design, and robotics could be reduced to either geometric constraint solving or geometric reasoning. And, conversely, a great variety of methods following very different approaches have been studied for solving geometric constraints and for proving geometric theorems.
This track will be a great opportunity to gather researchers coming from communities concerned by subjects as different as constraint programming, numeric analysis, CAD, theorem proving and computer graphics.

Track Topics

Specific topics of interest for the GCR track include, but are not limited to, the following:

GCR 2011 will be an opportunity to gather several communities involved in geometric computing and reasoning:

Submission Information for Authors

Authors are invited to submit original and unpublished work in the domain of GCR.
Submissions must be done according to the following guidelines:

Important Due Dates

31 August 2011 : Paper Submission

12 October 2011 : Author Notification

2 November 2011 : Camera-ready copy of accepted papers

21-25 March 2010 : Track Sessions

Final Program

GCR Track Schedule and Presentations

GCR Track Papers

  1. Formalizing Desargues's Theorem in Coq Using Ranks
    Nicolas Magaud, Université de Strasbourg, France
    Julien Narboux, Université de Strasbourg, France
    Pascal Schreck, Université de Strasbourg, France
  2. Infinite Bar-Joint Frameworks
    J.C. Owen, D-Cubed, Seimens PLM Software Ltd., United Kingdom
    S.C. Power, Lancaster University, United Kingdom
  3. Characterizing 1-Dof Henneberg-I Graphs with Efficient Configuration Spaces
    Heping Gao, Universtiy of Florida, USA
    Meera Sitharam, University of Florida, USA
  4. Body-and-Cad Geometric Constraint Systems
    Kirk Haller, SolidWorks Corporation, USA
    Audrey Lee-St. John, Mount Holyoke College, USA
    Meera Sitharam, University of Florida, USA
    Ileana Streinu, Smith College, USA
    Neil White, University of Florida, USA
  5. Origami Fold as Algebraic Graph Rewriting
    Tetsuo Ida, University of Tsukuba, Japan
    Hidekazu Takahashi, University of Tsukuba, Japan

GCR Track Posters

  1. The Unique Solution for P3P Problem
    Jianliang Tang, College of Mathematics and Computing Science, Shenzhen University, China
    Nengzeng Liu, College of Mathematics & Computing Science, Shenzhen University, China
  2. Topology Determination and Isolation for Implicit Plane Curves
    Jin-San Cheng, Chinese Academy of Sciences, China
    Xiao-Shan Gao, Chinese Academy of Sciences, China
    Jia Li, Chinese Academy of Sciences, China
  3. Multivariate Root Finding with Search Space Decomposition and Randomisation
    Markus Färber, Technische Universität Ilmenau, Germany
    Beat Brüderlin, Technische Universität Ilmenau, Germany


  1. Organizing Committee

    Xiao-Shan Gao
    Institute of Systems Science, Chinese Academy of Sciences.
    Beijin, China.
    email: xgao@mmrc.iss.ac.cn

    Robert Joan-Arinyo
    Universitat Politècnica de Catalunya
    Barcelona, Catalonia.
    email: robert@lsi.upc.edu

    Dominique Michelucci
    Université de Bourgogne
    Dijon, France.
    email: Dominique.Michelucci@u-bourgogne.fr

  2. Program Committee

    Francisco Botana
    Wim Bronsvoort
    Ching-Shoei Chiang
    Jean-François Dufourd
    Luiz Henrique de Figueiredo
    Jacques Fleuriot
    Ioannis Fudos
    Chris Hoffmann
    Tetsuo Ida
    Predrag Janicic
    Christophe Jermann
    Ulrich Kortenkamp
    Hongbo Li
    John C. Owen
    Tomás Recio
    Michel Rueher
    Pascal Schreck
    Philippe Serré
    Meera Sitharam
    Toni Soto-Riera
    Ileana Streinu
    Lu Yang
    Sebastià Vila
    Universidad de Vigo, Spain
    Delft University of Technology, Netherlands
    Soochow University, Taiwan
    Université de Strasbourg, France
    Instituto de Matematica Pura e Aplicada, Brazil
    University of Edinburgh, UK
    University of Ioannina, Greece
    Purdue University, USA
    University of Tsukuba, Japan
    University of Belgrade, Serbia
    Université de Nantes, France
    University of Education Karlsruhe, Germany
    Academy of Sciences, China
    Siemens, UK
    Universidad de Cantabria, Spain
    Université de Nice, Sophia Antipolis, France
    Université de Strasbourg, France
    Supméca, France
    University of Florida, USA
    Universitat Politècnica de Catalunya, Catalonia
    Smith College, USA
    Chengdu Institute, China
    Universitat Politècnica de Catalunya, Catalonia