RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS
DOI10.1142/S0218195910003463zbMath1207.65060OpenAlexW2061263184MaRDI QIDQ3070041
Yong Zhou, Sitharam, Meera, 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
matroidsgraph algorithmssolving polynomial systems3D geometric constraint systemscombinatorial preprocessing of algebraic systemsgraph-based optimization of algebraic complexity
Numerical computation of solutions to systems of equations (65H10) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Numerical computation of roots of polynomial equations (65H04)
Related Items (2)
Cites Work
- Curve intersection using Bézier clipping
- Optimized parametrization of systems of incidences between rigid bodies
- The Dress conjectures on rank in the 3-dimensional rigidity matroid
- ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID
- Direct Methods for Sparse Linear Systems
- Sparse Matrices in MATLAB: Design and Implementation
- Computing quadric surface intersections based on an analysis of plane cubic curves
This page was built for publication: RECONCILING CONFLICTING COMBINATORIAL PREPROCESSORS FOR GEOMETRIC CONSTRAINT SYSTEMS