A 2D geometric constraint solver using a graph reduction method

Samy Ait-Aoudia, Sebti Foufou

Research output: Contribution to journalArticle

Abstract

Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design intended by exploiting these constraints. The constraints solvers can be classified in four categories: symbolic, numerical, rule-oriented and graph-constructive solvers. The graph constructive approach is widely used in recent Computer Aided Design (CAD) systems. In this paper, we present a decomposition-recombination (DR) planning algorithm, called S-DR, that uses a graph reduction method to solve systems of 2D geometric constraints. Based on the key concept of skeletons, S-DR planner figures out a plan for decomposing a well constrained system into small sub-systems and recombines the solutions of these sub-systems to derive the solution of the entire system.

Original languageEnglish (US)
Pages (from-to)1187-1194
Number of pages8
JournalAdvances in Engineering Software
Volume41
Issue number10-11
DOIs
StatePublished - Jan 1 2010

Fingerprint

Decomposition
Computer aided design
Planning

Keywords

  • Decomposition-recombination (DR) planning
  • Geometric constraints
  • Graph algorithms
  • Graph-constructive solver
  • Modeling by constraints
  • Under-constrained problems

ASJC Scopus subject areas

  • Software
  • Engineering(all)

Cite this

A 2D geometric constraint solver using a graph reduction method. / Ait-Aoudia, Samy; Foufou, Sebti.

In: Advances in Engineering Software, Vol. 41, No. 10-11, 01.01.2010, p. 1187-1194.

Research output: Contribution to journalArticle

@article{1d2ac85d62a145a49e974dda0782a39b,
title = "A 2D geometric constraint solver using a graph reduction method",
abstract = "Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design intended by exploiting these constraints. The constraints solvers can be classified in four categories: symbolic, numerical, rule-oriented and graph-constructive solvers. The graph constructive approach is widely used in recent Computer Aided Design (CAD) systems. In this paper, we present a decomposition-recombination (DR) planning algorithm, called S-DR, that uses a graph reduction method to solve systems of 2D geometric constraints. Based on the key concept of skeletons, S-DR planner figures out a plan for decomposing a well constrained system into small sub-systems and recombines the solutions of these sub-systems to derive the solution of the entire system.",
keywords = "Decomposition-recombination (DR) planning, Geometric constraints, Graph algorithms, Graph-constructive solver, Modeling by constraints, Under-constrained problems",
author = "Samy Ait-Aoudia and Sebti Foufou",
year = "2010",
month = "1",
day = "1",
doi = "10.1016/j.advengsoft.2010.07.008",
language = "English (US)",
volume = "41",
pages = "1187--1194",
journal = "Advances in Engineering Software",
issn = "0965-9978",
publisher = "Elsevier Limited",
number = "10-11",

}

TY - JOUR

T1 - A 2D geometric constraint solver using a graph reduction method

AU - Ait-Aoudia, Samy

AU - Foufou, Sebti

PY - 2010/1/1

Y1 - 2010/1/1

N2 - Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design intended by exploiting these constraints. The constraints solvers can be classified in four categories: symbolic, numerical, rule-oriented and graph-constructive solvers. The graph constructive approach is widely used in recent Computer Aided Design (CAD) systems. In this paper, we present a decomposition-recombination (DR) planning algorithm, called S-DR, that uses a graph reduction method to solve systems of 2D geometric constraints. Based on the key concept of skeletons, S-DR planner figures out a plan for decomposing a well constrained system into small sub-systems and recombines the solutions of these sub-systems to derive the solution of the entire system.

AB - Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design intended by exploiting these constraints. The constraints solvers can be classified in four categories: symbolic, numerical, rule-oriented and graph-constructive solvers. The graph constructive approach is widely used in recent Computer Aided Design (CAD) systems. In this paper, we present a decomposition-recombination (DR) planning algorithm, called S-DR, that uses a graph reduction method to solve systems of 2D geometric constraints. Based on the key concept of skeletons, S-DR planner figures out a plan for decomposing a well constrained system into small sub-systems and recombines the solutions of these sub-systems to derive the solution of the entire system.

KW - Decomposition-recombination (DR) planning

KW - Geometric constraints

KW - Graph algorithms

KW - Graph-constructive solver

KW - Modeling by constraints

KW - Under-constrained problems

UR - http://www.scopus.com/inward/record.url?scp=77956612734&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77956612734&partnerID=8YFLogxK

U2 - 10.1016/j.advengsoft.2010.07.008

DO - 10.1016/j.advengsoft.2010.07.008

M3 - Article

VL - 41

SP - 1187

EP - 1194

JO - Advances in Engineering Software

JF - Advances in Engineering Software

SN - 0965-9978

IS - 10-11

ER -