What is a parametric family of solids?
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
The generic geometric complex (GGC): a modeling scheme for families of decomposed pointsets
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Boundary representation deformation in parametric solid modeling
ACM Transactions on Graphics (TOG)
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
On Families of Objects and their Semantics
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Efficiency of boundary evaluation for a cellular model
Computer-Aided Design
Geometric constraints within feature hierarchies
Computer-Aided Design
Tracking topological changes in feature models
Proceedings of the 2007 ACM symposium on Solid and physical modeling
On the long-term retention of geometry-centric digital engineering artifacts
Computer-Aided Design
| Hi-index | 0.00 |
Parametric and feature-based CAD models can be thought of to represent families of similar objects. In current modelling systems, however, model semantics is unclear and ambiguous in the context of families of objects.We present the Declarative Family of Objects Model (DFOM), which enables to adequately specify and maintain family semantics. In this model, not only geometry, but also topology is specified declaratively, by means of constraints. A family of objects is modelled by a DFOM with multiple realisations. A member of the family is modelled by adding constraints, e.g. to set dimension variables, until a single realisation remains. The declarative approach guarantees that the realisation of a family member is also a realisation of the family.The realisation of a family member is found by solving first the geometric constraints, then the topological constraints. From the geometric solution, a cellular model is constructed. Topological constraints indirectly specify which combinations of cellular model entities are allowed in the realisation. The system of topological constraints is translated into a boolean constraint satisfaction problem. The realisation is found by solving this problem. The feasibility of solving topological constraints has been investigated using an existing boolean satisfiability solver.