Approximating Continuous Motions of Geometric Constraint Systems
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910121806790656 |
|---|---|
| author | Adrian-Himmelmann, Matthias |
| author_facet | Adrian-Himmelmann, Matthias |
| contents | The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural engineering and soft matter physics. When a geometric constraint system is flexible, it admits continuous deformations. The ability to explicitly compute such continuous motions is essential for analyzing the constraint system's quasistatic or elastic properties. However, this task is computationally challenging, even for comparatively simple geometric constraint systems, making numerical strategies attractive.
In this article, we present a general numerical framework for approximating continuous motions of geometric constraint systems given by quadratic polynomials. Our approach combines Riemannian optimization with numerical algebraic geometry to construct continuous motions via the metric projection onto the constraint set. By using homotopy continuation, we ensure that the computed motions correspond to genuine solutions of the constraint system and avoid numerical artifacts such as path-jumping. To handle singularities and over-determined systems, we introduce theoretical enhancements including randomization, adaptive step size control and a second-order analysis. These methods are implemented in the Julia package DeformationPaths.jl, which supports a broad class of geometric constraint systems and demonstrates its robust and effective performance across a wide range of test cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_08016 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Approximating Continuous Motions of Geometric Constraint Systems Adrian-Himmelmann, Matthias Metric Geometry 52-04, 52C25, 53B21, 65H14, 70B15 The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural engineering and soft matter physics. When a geometric constraint system is flexible, it admits continuous deformations. The ability to explicitly compute such continuous motions is essential for analyzing the constraint system's quasistatic or elastic properties. However, this task is computationally challenging, even for comparatively simple geometric constraint systems, making numerical strategies attractive. In this article, we present a general numerical framework for approximating continuous motions of geometric constraint systems given by quadratic polynomials. Our approach combines Riemannian optimization with numerical algebraic geometry to construct continuous motions via the metric projection onto the constraint set. By using homotopy continuation, we ensure that the computed motions correspond to genuine solutions of the constraint system and avoid numerical artifacts such as path-jumping. To handle singularities and over-determined systems, we introduce theoretical enhancements including randomization, adaptive step size control and a second-order analysis. These methods are implemented in the Julia package DeformationPaths.jl, which supports a broad class of geometric constraint systems and demonstrates its robust and effective performance across a wide range of test cases. |
| title | Approximating Continuous Motions of Geometric Constraint Systems |
| topic | Metric Geometry 52-04, 52C25, 53B21, 65H14, 70B15 |
| url | https://arxiv.org/abs/2602.08016 |