Hostname: page-component-cd9895bd7-lnqnp Total loading time: 0 Render date: 2024-12-18T12:27:29.094Z Has data issue: false hasContentIssue false
  • English
  • Français

Approximating shapes with hierarchies and topologies

Published online by Cambridge University Press:  02 September 2009

Djordje Krstic
Djordje Krstic
Affiliation:
Calabasas, California, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

This is the second paper in the series on shape decompositions and their use as shape approximations. This time we investigate hierarchical and topological shape decompositions or hierarchies and topologies. We showed earlier that bounded decompositions behave the same way as shapes do. The same holds for hierarchies and topologies, which are special kinds of bounded decompositions. They are distinguished by their algebraic structures, which have many important properties to facilitate their application as shape approximations. We provide an account of their properties with an emphasis on their application.

Keywords

HierarchiesShape AlgebrasShape DecompositionsShape GrammarsTopologies
Type
Regular Articles
Information
AI EDAM , Volume 24 , Issue 2: Creativity: Simulation, Stimulation, and Studies , May 2010 , pp. 259 - 276
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Birkhoff, G. (1993). Lattice Theory. Providence, RI: American Mathematical Society.Google Scholar
Earl, C. (1997). Shape boundaries. Environment and Planning B: Planning and Design 24, 668–687.CrossRefGoogle Scholar
Krstic, D. (1996). Decompositions of shapes. PhD Thesis. University of California, Los Angeles.Google Scholar
Krstic, D. (1999). Constructing algebras of design. Environment and Planning B: Planning and Design 26, 45–57.CrossRefGoogle Scholar
Krstic, D. (2001). Algebras and grammars for shapes and their boundaries. Environment and Planning B: Planning and Design 28, 151–162.CrossRefGoogle Scholar
Krstic, D. (2004). Computing with analyzed shapes. In Design Computing and Cognition '04 (Gero, J.S., Ed.), pp. 397–416. Dordrecht: Kluwer Academic.CrossRefGoogle Scholar
Krstic, D. (2005). Shape decompositions and their algebras. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 19, 261–276.CrossRefGoogle Scholar
Lee, Y.T., & Requicha, A.A.G. (1982). Algorithms for computing the volume and other integral properties of solids I: known methods and open issues. Communications of the ACM 25, 635–641.CrossRefGoogle Scholar
Ojeda, O.R. (1997). The New American House 2: Innovations in Residential Design, 30 Case Studies. New York: Whitney Library of Design, an imprint of Watson–Guptill Publications.Google Scholar
Stiny, G. (1991). The algebras of design. Research in Engineering Design 2, 171–181.CrossRefGoogle Scholar
Stiny, G. (1992). Weights. Environment and Planning B: Planning and Design 19, 413–430.CrossRefGoogle Scholar
Stiny, G. (1994). Shape rules: closure, continuity, and emergence. Environment and Planning B: Planning and Design 21, S49–S78.CrossRefGoogle Scholar
Stiny, G. (2006). Shape: Talking About Seeing and Doing. Cambridge, MA: MIT Press.CrossRefGoogle Scholar
Timmer, H., & Stern, J. (1980). Computation of global geometric properties of solid objects. Computer Aided Design 10, 301–304.CrossRefGoogle Scholar
Vickers, S. (1989). Topology Via Logic. New York: Cambridge University Press.Google Scholar