This article presents a metalanguage called GCML which allows the description of geometric constraint problems. In the spirit of algebraic specifications, it constitutes a framework to accompany a geometric problem from its expression to its solution. Its originality is to provide a problem with its framework called geometric universe, a tuple (syntax, semantic) which allows to get rid of ambiguities and limitations concerning description which is then freed from any software restriction. Moreover, distinction between syntax and semantic allows pre and post treatments in order to generate tools while adopting different semantic points of view in the following fields: modeling, visualization, resolution and documentation. Pragmatically, this metalanguage is based upon XML which is a language of terminology description, and allows to embed other terminologies to express different semantics.
[1]
Xiao-Shan Gao,et al.
Solving spatial basic geometric constraint configurations with locus intersection
,
2002,
SMA '02.
[2]
Joseph A. Goguen,et al.
Modular Algebraic Specification of Some Basic Geometrical Constructions
,
1988,
Artif. Intell..
[3]
J. C. Owen,et al.
Algebraic solution for geometry from dimensional constraints
,
1991,
SMA '91.
[4]
Pascal Schreck.
Robustness in CAD geometric constructions
,
2001,
Proceedings Fifth International Conference on Information Visualisation.
[5]
J. Van Leeuwen,et al.
Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics
,
1990
.