A typical computer representation of a design includes geometric and physical information organized in a suitable combinatorial data structure. Queries and transformations of these design representations are used to formulate most algorithms in computational design, including analysis, optimization, evolution, generation, and synthesis. Formal properties, and in particular existence and validity of the computed solutions, must be assured and preserved by all such algorithms. Using tools from algebraic topology, we show that a small set of the usual combinatorial operators: boundary (∂), coboundary (δ), and dualization (*) — are sufficient to represent a variety of physical laws and invariants. Specific examples include geometric integrity, balance and equilibrium, and surface smoothing. Our findings point a way toward systematic development of data structures and algorithms for design in a common formal computational framework.
- Design Engineering Division and Computers and Information in Engineering Division
Combinatorial Laws for Physically Meaningful Design
- Views Icon Views
- Share Icon Share
- Search Site
Ramaswamy, V, & Shapiro, V. "Combinatorial Laws for Physically Meaningful Design." Proceedings of the ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. Volume 3b: 15th International Conference on Design Theory and Methodology. Chicago, Illinois, USA. September 2–6, 2003. pp. 585-594. ASME. https://doi.org/10.1115/DETC2003/DTM-48654
Download citation file: