Decomposition plans for geometric constraint systems. I: Performance measures for CAD
From MaRDI portal
Publication:5933499
DOI10.1006/jsco.2000.0402zbMath0972.68161OpenAlexW2152273360WikidataQ60326038 ScholiaQ60326038MaRDI QIDQ5933499
Andrew Lomonosov, Sitharam, Meera, Christoph M. Hoffmann
Publication date: 6 November 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0402
Related Items
Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Characterizing graphs with convex and connected Cayley configuration spaces ⋮ Solving interval constraints by linearization in computer-aided design ⋮ A 2D geometric constraint solver using a graph reduction method ⋮ Body-and-cad geometric constraint systems ⋮ A generalized Malfatti problem ⋮ Directed graphs, decompositions, and spatial linkages ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ Optimized parametrization of systems of incidences between rigid bodies ⋮ Interrogating witnesses for geometric constraint solving ⋮ CONSTRAINT MODELING FOR CURVES AND SURFACES IN CAGD: A SURVEY ⋮ Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method ⋮ ON THE RANK FUNCTION OF THE 3-DIMENSIONAL RIGIDITY MATROID ⋮ GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH ⋮ The reachability problem in constructive geometric constraint solving based dynamic geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- Solving systems of polynomial inequalities in subexponential time
- Résolution des systèmes d'équations algébriques
- Some examples of the use of distances as coordinates for euclidean geometry
- A new method for solving algebraic systems of positive dimension
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- An elimination method for polynomial systems
- CAD and the product master model.
- On the generic rigidity of bar-frameworks
- Geometric constraint solver
- On combinatorial structures of line drawings of polyhedra
- On graphs and rigidity of plane skeletal structures
- CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVER
- CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- Conditions for Unique Graph Realizations
- Finding a Minimum Circuit in a Graph
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Dividing a Graph into Triconnected Components
