Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Pascal Mathis"'
Autor:
Pascal Schreck, Pascal Mathis
Publikováno v:
Mathematics in Computer Science. 10:41-56
Straightedge and compass constructions play a special role in geometry. First, for a very long time, they were used in practice by land surveyors or architects in order to solve concrete problems. Second, they are an inexhaustible source of exercises
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bab457f616d3ad6fd89b7bb6f678cfec
https://doi.org/10.1007/s11786-016-0247-3
https://doi.org/10.1007/s11786-016-0247-3
Autor:
Pascal Mathis, Pascal Schreck
Publikováno v:
SCSS
In many areas, some geometry problems can not be solved using only geometry and are treated by the means of algebraic tools. However, geometric properties can be still employed to simplify the system of equations. This allows either to speed up the t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9b4242219082e783dda495ecad9f94c
https://doi.org/10.29007/b28w
https://doi.org/10.29007/b28w
Autor:
Pascal Mathis, Pascal Schreck
Publikováno v:
International Journal of Computational Geometry & Applications. 16:431-442
Since they help to specify the shape of real objects, geometric constraint systems encountered in CAD domain are often invariant by isometries. But other transformation groups can be considered to improve the solving process. More precisely, using di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46a6468007a71aa95fd43fd9b263a6d6
https://doi.org/10.1142/s0218195906002129
https://doi.org/10.1142/s0218195906002129
Publikováno v:
International Journal of Computational Geometry and Applications
International Journal of Computational Geometry and Applications, 2006, 16 (5-6), pp.379-414. ⟨10.1142/S0218195906002105⟩
International Journal of Computational Geometry and Applications, 2006, 16 (5-6), pp.379-414. ⟨10.1142/S0218195906002105⟩
Significant progress has been accomplished during the past decades about geometric constraint solving, in particular thanks to its applications in industrial fields like CAD and robotics. In order to tackle problems of industrial size, many solving m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c14c760ba5de47cb7bf47ba180414ede
https://doi.org/10.1142/s0218195906002105
https://doi.org/10.1142/s0218195906002105
Publikováno v:
Computer-Aided Design
Computer-Aided Design, Elsevier, 2014, 46, pp.138-147. ⟨10.1016/j.cad.2013.08.026⟩
Computer-Aided Design, 2014, 46, pp.138-147. ⟨10.1016/j.cad.2013.08.026⟩
Computer-Aided Design, Elsevier, 2014, 46, pp.138-147. ⟨10.1016/j.cad.2013.08.026⟩
Computer-Aided Design, 2014, 46, pp.138-147. ⟨10.1016/j.cad.2013.08.026⟩
International audience; Geometric constraint problems arise in domains such as CAD, Robotics, Molecular Chemistry, whenever one expects 2D or 3D configurations of some geometric primitives fulfilling some geometric constraints. Most well-constrained
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8bf34c3ec09b5da324a0cf34a0ebca0e
https://hal.archives-ouvertes.fr/hal-02077917
https://hal.archives-ouvertes.fr/hal-02077917
Publikováno v:
Artificial Intelligence. 99(1):73-119
Among the expected contributions of Artificial Intelligence to Computer-Aided Design is the possibility of constructing a geometric object, the description of which is given by a system of topological and dimensional constraints. This paper presents
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e7e4b92d59f24d06973fb34ce074c62
Autor:
Pascal Schreck, Pascal Mathis
Publikováno v:
Automated Deduction in Geometry ISBN: 9783642406713
Automated Deduction in Geometry
Automated Deduction in Geometry
In geometric constraint solving, it is usual to consider Cayley-Menger determinants in particular in robotics and molecular chemistry, but also in CAD. The idea is to regard distances as coordinates and to build systems where the unknowns are distanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a3c223880a9a7b462f8c421d932a494b
https://doi.org/10.1007/978-3-642-40672-0_5
https://doi.org/10.1007/978-3-642-40672-0_5
Publikováno v:
24th IEEE International Conference on Tools with Artificial Intelligence
24th IEEE International Conference on Tools with Artificial Intelligence, Nov 2012, Athens, Greece. pp.1139-1144, ⟨10.1109/ICTAI.2012.162⟩
ICTAI
24th IEEE International Conference on Tools with Artificial Intelligence, Nov 2012, Athens, Greece. pp.1139-1144, ⟨10.1109/ICTAI.2012.162⟩
ICTAI
International audience; Constraint satisfaction problems related to geometry mostly arise in CAD. But even though they are designed for geometry, none of the methods proposed to solve these problems fully meets the requirements needed by the educatio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::652c7c86917f63943e6ec2e9df915de2
https://hal.inria.fr/hal-00753551/document
https://hal.inria.fr/hal-00753551/document
Publikováno v:
SAC
SAC '12-Proceedings of the 27th Annual ACM Symposium on Applied Computing
SAC '12-Proceedings of the 27th Annual ACM Symposium on Applied Computing, Mar 2012, Trento, France. pp.102-108, ⟨10.1145/2245276.2245298⟩
SAC '12-Proceedings of the 27th Annual ACM Symposium on Applied Computing
SAC '12-Proceedings of the 27th Annual ACM Symposium on Applied Computing, Mar 2012, Trento, France. pp.102-108, ⟨10.1145/2245276.2245298⟩
International audience; Decomposition of constraint systems is a key component of geometric constraint solving in CAD. On the other hand, some authors have introduced the notion of reparameterization which aims at helping the solving of indecomposabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66b6178be0ad7f5218de4a64fd68d9a1
https://doi.org/10.1145/2245276.2245298
https://doi.org/10.1145/2245276.2245298
Publikováno v:
SYNASC
SYNASC 2011-13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
SYNASC 2011-13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2011, Timisoara, Romania. pp.31-38, ⟨10.1109/SYNASC.2011.26⟩
SYNASC 2011-13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
SYNASC 2011-13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Sep 2011, Timisoara, Romania. pp.31-38, ⟨10.1109/SYNASC.2011.26⟩
International audience; In CAD, constraint solvers allow a user to describe a figure or an object with a set of constraints like distances, angles, tangencies, incidences and so on. Geometric solvers proceed in two stages. First, a symbolic construct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be1e3661cdcfd82858ec940a92260fb6
https://doi.org/10.1109/synasc.2011.26
https://doi.org/10.1109/synasc.2011.26