Decomposition plans for geometric constraint problems. II: New algorithms

DOI10.1006/JSCO.2000.0403MaRDI QIDQ5933500zbMATH OpenOpenAlexWikidataFDO

Authors Christoph M. Hoffmann, Andrew Lomonosov, Meera Sitharam

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

zbMATH Keywords

CAD/CAMconstraint shape recognitionDR-planning problemmaximum matching

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Recommendations

• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• A formalization of geometric constraint systems and their decomposition
• Geometric constraint decomposition: the general case
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• A 2D geometric constraint solver using a graph reduction method

Cites work

• Computing in Euclidean Geometry
• CONSTRAINTS ON SIMPLE GEOMETRY IN TWO AND THREE DIMENSIONS
• CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVER
• Geometric constraint solver
• scientific article; zbMATH DE number 1261014 (Why is no real title available?)
• scientific article; zbMATH DE number 1031283 (Why is no real title available?)

Cited in

(19)

• Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
• Combinatorial rigidity of incidence systems and application to dictionary learning
• Optimized parametrization of systems of incidences between rigid bodies
• The reachability problem in constructive geometric constraint solving based dynamic geometry
• Characterizing graphs with convex and connected Cayley configuration spaces
• Directed graphs, decompositions, and spatial linkages
• GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH
• Body-and-cad geometric constraint systems
• A generalized Malfatti problem
• Geometric constraint decomposition: the general case
• A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs
• INTERVAL-BASED TRACING OF STRANGE ATTRACTORS
• Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD
• A 2D geometric constraint solver using a graph reduction method
• Synchronized Planarity with Applications to Constrained Planarity Problems
• Tracking topological changes in parametric models
• Interrogating witnesses for geometric constraint solving
• Solving interval constraints by linearization in computer-aided design

This page was built for publication: Decomposition plans for geometric constraint problems. II: New algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933500)