On the reducibility of geometric constraint graphs

Abstract : Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard modeling tools. In this discipline, a geometric form is specified by the relations that the components of this form must verify instead of explicitly specifying these components. The purpose of the resolution is to deduce the form satisfying all these constraints. Various methods have been proposed to solve this problem. We will focus on the so-called graph-based or graph-based methods with application to the two-dimensional space.
Type de document :
Pré-publication, Document de travail
2018
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01663288
Contributeur : Samy Ait-Aoudia <>
Soumis le : dimanche 4 mars 2018 - 08:22:09
Dernière modification le : lundi 5 novembre 2018 - 16:24:04

Fichier

On the reducibility of geometr...
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01663288, version 2
  • ARXIV : 1712.05578

Collections

Citation

Samy Ait-Aoudia, Adel Moussaoui, Khaled Abid, Dominique Michelucci. On the reducibility of geometric constraint graphs. 2018. 〈hal-01663288v2〉

Partager

Métriques

Consultations de la notice

51

Téléchargements de fichiers

29