Honolulu, Hawaii


Geometric Constraints and Reasoning

Technical track of the 24th Annual ACM

Symposium on Applied Computing

SAC 2009

March 8-12, 2009

Honolulu, Hawaii, USA


SAC 2009

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 24th Annual SAC meeting will be held 8-12 March 2009 in Honolulu, Hawaii, USA, and is hosted by the University of Hawaii at Manoa and Chaminade University of Honolulu . More information about SIGAPP can be found at http://www.acm.org/sigapp. and on past anc currectt 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 fourth edition Its first edition hold in Dijon (France) in the framework of SAC2006. The second edition was hold in Seoul (Korea) inside SAC2007. The third edition took place in Fortaleza, Brazil, inside SAC2008.
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 2009 will be an opportunity to gather several communities involved in geometric computing and reasoning:

Journal Publication

Authors of selected papers of outstanding quality that have been presented at GCR'09 will be invited to submit a full length version to a special issue of Computational Geometry: Theory and Applications

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 Dates

16 Aug 2008 : Papers submissions

extended to 23 Aug 2008 : Papers submissions

11 Oct 2008 : Author notification

8-12 March 2009 : Track Sessions

Final Program

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


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

Program Committee

Francisco Botana
Wim Bronsvoort
Jean-François Dufourd
Luiz Henrique de Figueiredo
Jacques Fleuriot
Ioannis Fudos
Chris Hoffmann
Tetsuo Ida
Ulrich Kortenkamp
Hongbo Li
John C. Owen
Tomás Recio
Alain Riviere
Pascal Schreck
Meera Sitharam
Toni Soto-Riera
Ileana Streinu
Jan Verschelde
Lu Yang
Universidad de Vigo, Spain
Delft University of Technology, Netherlands
University of Strasbourg, France
Instituto de Matematica Pura e Aplicada, Brazil
University of Edinburgh, UK
University of Ioannina, Greece
Purdue University, USA
University of Tsukuba, Japan
Schwäbisch Gmünd, Germany
Academy of Sciences, China
D-Cubed Ltd, UK
Universidad de Cantabria, Spain
University of Strasbourg, France
University of Florida, USA
Universitat Politècnica de Catalunya, Catalonia
Smith College, USA
University of Illinois at Chicago, USA
Chengdu Institute, China