Reconciling conflicting combinatorial preprocessors for geometric constraint systems
DOI10.1142/S0218195910003463zbMATH Open1207.65060OpenAlexW2061263184MaRDI QIDQ3070041FDOQ3070041
Authors: Meera Sitharam, Yong Zhou, Jörg Peters 
Publication date: 2 February 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195910003463
Recommendations
- scientific article; zbMATH DE number 5130862
- Geometric constraint solving with geometric transformation
- Combinatorial approaches to geometrie constraint solving: problems, progress, and directions
- WELL-FORMED SYSTEMS OF POINT INCIDENCES FOR RESOLVING COLLECTIONS OF RIGID BODIES
- scientific article; zbMATH DE number 1745032
graph algorithmsmatroidssolving polynomial systems3D geometric constraint systemscombinatorial preprocessing of algebraic systemsgraph-based optimization of algebraic complexity
Graph algorithms (graph-theoretic aspects) (05C85) Numerical computation of solutions to systems of equations (65H10) Combinatorial aspects of matroids and geometric lattices (05B35) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Direct Methods for Sparse Linear Systems
- Computing quadric surface intersections based on an analysis of plane cubic curves
- Curve intersection using Bézier clipping
- Sparse Matrices in MATLAB: Design and Implementation
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
- Optimized parametrization of systems of incidences between rigid bodies
Cited In (4)
This page was built for publication: Reconciling conflicting combinatorial preprocessors for geometric constraint systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070041)
