SAC2006

For the past twenty years, the ACM Symposium on Applied Computing has been a primary gathering forum for applied computer scientists, computer engineers and application developers to gather, interact, and present their work. SAC 2006 is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP), and is hosted by the University of Bourgogne, Dijon, France. Its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through ACM's Digital Library. More information about SIGAPP and past SACs can be found at the URL http://www.acm.org/sigapp.

Overview

Geometric Computing and Reasoning (GCR) is a new a track of SAC and it is dedicated 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 a large amount of 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 an great opportunity to gather researchers coming from communities concerned by subject as different as constraint programming, numeric analysis, CAD, theorem proving and computer graphics.

Scope

There is a lot of interesting problems related to geometric constraint solving and geometric theorem proving. Specific topics of interest for the GCR track include, but are not limited to, the following:

• resolution of geometric constraints, with computer algebra, numerical analysis, interval analysis, logical approaches (e.g. provers), or new methods,
• geometric theorem proving,
• decomposition of systems of geometric constraints,
• mixing geometric and non geometric constraints, white boxes, black boxes, geometric constraints and constraints programming,
• detection of dependencies between constraints, debugging geometric constraints,
• constrained curves, surfaces, blends,
• "exotic" formulations of geometric constraints,
• comparison of resolution methods or constraints formulations for the same problems,
• mathematical background: combinatorial rigidity, graph theory, matroid theory, computer algebra,
• detailed applications, in Computer Graphics, CAD-CAM, robotics, mechanism design, chemistry , photogrammetry, virtual reality,
• sensitivity to value parameters, and other robustness issues,
• choice of the "good" solution,
• dynamic geometry, pedagogical purposes, generating explanations, examples, counter examples,
• computer-human interfaces for geometric constraints,
• geometric constraints and data exchange,
• topological constraints, eg optimal curves or surfaces with prescribed, topology (homology, homotopy, isotopy), shape optimization,
• geometric constraints and geometric representations (boundary representation, constructive solid geometry, features),
• integration of geometric solvers into modelers, geometric solver industrial/market solutions
• constraints versus features
• reverse engineering and capture of designer intents
• definition of new kinds of constraints (i.e.: topological constraints; ergonomic constraints; esthetic constraints; kinematic constraints; physical constraints; assembly-disassembly constraints) and how to manage them
• persistent naming problem and geometric modeling by constraints

Submission

Authors are invited to submit original and unpublished work in the domain of GCR.
Each submitted paper will be blindly reviewed. Accepted papers will be published in the annual conference proceedings. Submission guideline will be posted on SAC 2006 website.

The following paper submission guidelines should be followed:

• Abstract submissions should be sent by Sept. 1, 2005 via eCMS system at URL http://milo.cs.iupui.edu/sac2006/SubmitAbstract.aspx?TrackID=47
  Important note. Authors must contact Jeff Allen for any problems with the system.
• Paper submission should be sent by Sept. 3, 2005 via eCMS system (whose URL will be given with the reply to individual abstract submissions).
  Please, in order to facilitate blind review, authors must respect the following guidelines:
  • The name(s) and address(es) of the author(s) must not appear in the body of the paper, and self-reference should be in the third person.
  • The body of the paper should not exceed 4,000 words (approximately 15 pages, double-spaced, 12-point font size). Later, if accepted, paper must fit within five (5) two column pages, with the option (at additional expense) to add three (3) more pages.
  • A separate file containing a COVER SHEET should include the title of the paper, a maximum of five keywords selected among the topics of interest of the track, the name(s), affiliation(s), and address(es), email(s), phone(s) and ax(es) of the AUTHOR(S).
  • In the submission E-MAIL, please include the title of the paper, a maximum of five keywords selected among the topics of interest of the track, the name, affiliation, address, email, phone, and fax of the author who serves as the CONTACT PERSON for the paper.
• Please note that a paper cannot be submitted to more than one track.

Important Dates

Sept. 1, 2005: Abstract submissions

Sept. 3, 2005: Paper/Tutorial submissions

Oct. 15, 2005: Author notification

Nov. 5, 2005: Camera-Ready Copy

Apr. 23-27: Track sessions

Accepted Papers

Four papers are accepted.

• NFP-based Nesting Algorithm for Irregular Shapes, by Liu Hu Yao and He Yuan Jun


• An Adjustment Model in a Geometric Constraint Solving Problem, by Reyes Pavon, Fernando, Diaz and M. Victoria Luzon.


• A framework for geometric constraint satisfaction problem, by Julien Wintz, Pascal Schreck, Pascal Mathis and Arnaud Fabre.


• Spatial Geometric Constraint Solving Based on k-connected Graph Decomposition, by GuiFang Zhang and Xiao-Shan Gao.

Track schedule

Thursday April 27, 2006.

14h-15h-30, Amphi Albert Recoura

• NFP-based Nesting Algorithm for Irregular Shapes, by Liu Hu Yao and He Yuan.


• An Adjustment Model in a Geometric Constraint Solving Problem, by Reyes Pavon, Fernando, Diaz and M. Victoria Luzon. Presented by Reyes Pavon : pdf file, and ppt file.


• A framework for geometric constraint satisfaction problem by Julien Wintz, Pascal Schreck, Pascal Mathis and Arnaud Fabre. Presented by Julien Wintz : pdf file.


• Spatial Geometric Constraint Solving Based on k-connected Graph Decomposition,by GuiFang Zhang and Xiao-Shan Gao. Presented by Dominique Michelucci (for Xiao-Shan Gao) : pdf file and ppt file.

Organization

Organizing committee

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

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

Pascal Schreck
Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection
UMR 7005 CNRS-Université Louis Pasteur
Strasbourg, France
email: schreck@dpt-info.u-strasbg.fr
web: http://axis.u-strasbg.fr/~schreck

Program committee

Jean-François Dufourd, France, email: jfd@dpt-info.u-strasbg.fr

Chris Hoffmann, USA, email: cmh@cs.purdue.edu

Robert Joan-Arinyo, Spain, email: robert@lsi.upc.edu

Deepak Kapur, USA, email: kapur@cs.unm.edu

Ulrich Kortenkamp, Germany, email: kortenkamp@math.tu-berlin.de

Jean-Marie Laborde, France, email: Jean-Marie.Laborde@cabri.com

Hongbo Li, China, email: hli@mmrc.iss.ac.cn

Bernard Mourrain, France, email: Bernard.Mourrain@sophia.inria.fr

Tomas Recio, Spain, email: tomas.recio@telefonica.net

Meera Sitharam, USA, email: sitharam@cise.ufl.edu

Lu Yang, China, email: lyang@sei.ecnu.edu.cn