Decomposition plans for geometric constraint problems. II: New algorithms
From MaRDI portal
Publication:5933500
DOI10.1006/jsco.2000.0403zbMath0972.68162OpenAlexW2047528968WikidataQ60326039 ScholiaQ60326039MaRDI QIDQ5933500
Christoph M. Hoffmann, Sitharam, Meera, Andrew Lomonosov
Publication date: 16 May 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.2000.0403
Related Items (16)
INTERVAL-BASED TRACING OF STRANGE ATTRACTORS ⋮ 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 ⋮ Tracking topological changes in parametric models ⋮ 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 ⋮ Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method ⋮ GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH ⋮ The reachability problem in constructive geometric constraint solving based dynamic geometry
Cites Work
This page was built for publication: Decomposition plans for geometric constraint problems. II: New algorithms
