An official website of the United States government
Abstract We present a novel methodology to generate mechanical structures based on fractal geometry using the chaos game, which generates self-similar point-sets within a polygon. Using the Voronoi decomposition of these points, we are able to generate groups of self-similar structures that can be related back to their chaos game parameters, namely, the polygonal domain, fractional distance, and number of samples. Our approach explores the use of forward design of generative structures, which in some cases can be easier to use for designing than inverse generative design techniques. To this end, the central hypothesis of our work is that structures generated using the chaos game can generate families of self-similar structures that, while not identical, exhibit similar mechanical behavior in a statistical sense. We present a systematic study of these self-similar structures through modal analysis and tensile loading and demonstrate a preliminary confirmation of our hypothesis.
more »
« less
Generative Design of Statistically Self-Similar Mechanical Structures
Abstract We present a novel methodology to generate mechanical structures based on the idea of fractal geometry as described by the chaos game. Chaos game is an iterative method that generates self-similar point-sets in the limiting case within a polygonal domain. By computing Voronoi tessellations on these point-sets, our method generates mechanical structures that adopts the self-similarity of the point-sets resulting in fractal distribution of local stiffness. The motivation behind our approach comes from the observation that a typical generative structural design workflow requires the ability to generate families of structures that possess shared behavioral (e.g. thermal, mechanical, etc.) characteristics making each structure distinct but feasible. However, the generation of the alternatives, almost always, requires solving an inverse structural problem which is both conceptually and computationally challenging. The objective of our work is to develop and investigate a forward-design methodology for generating families of structures that, while not identical, exhibit similar mechanical behavior in a statistical sense. To this end, the central hypothesis of our work is that structures generated using the chaos game can generate families of self-similar structures that, while not identical, exhibit similar mechanical behavior in a statistical sense. Furthermore, each family is uniquely identifiable from the parameters of the chaos game, namely, the polygonal domain, fractional distance, and number of samples. We present a systematic study of these self-similar structures through modal analysis and demonstrate a preliminary confirmation of our hypothesis.
more »
« less
- Award ID(s):
- 2048182
- PAR ID:
- 10522982
- Publisher / Repository:
- American Society of Mechanical Engineers
- Date Published:
- ISBN:
- 978-0-7918-8729-5
- Format(s):
- Medium: X
- Location:
- Boston, Massachusetts, USA
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Amancio, Diego R. (Ed.)Using fractal analyses to study events allows us to capture the scale-independence of those events, that is, no matter at which level we study a phenomenon, we should get roughly the same results because events exhibit similar structure across scales. This is demonstrably true in mathematical fractals but is less assured in behavioral fractals. The current research directly tests the scale-independence hypothesis in the behavioral domain by exploring the fractal structure of aggression, a social phenomenon comprising events that span temporal scales from minutes of face-to-face arguments to centuries of international armed conflicts. Using publicly available data, we examined the temporal fractal structure of four scales of aggression: wars (very macrolevel, worldwide data), riots (macrolevel, worldwide data), violent crimes (microlevel, data gathered from cities and towns in the United States of America), and body movement during arguments (very microlevel, data gathered on American participants). Our results lend mixed support to the scale-independence hypothesis and provide insight into the self-organization of human interactions.more » « less
-
The inertial subrange of turbulent scales is commonly reflected by a power law signature in ensemble statistics such as the energy spectrum and structure functions – both in theory and from observations. Despite promising findings on the topic of fractal geometries in turbulence, there is no accepted image for the physical flow features corresponding to this statistical signature in the inertial subrange. The present study uses boundary layer turbulence measurements to evaluate the self-similar geometric properties of velocity isosurfaces and investigate their influence on statistics for the velocity signal. The fractal dimension of streamwise velocity isosurfaces, indicating statistical self-similarity in the size of ‘wrinkles’ along each isosurface, is shown to be constant only within the inertial subrange of scales. For the transition between the inertial subrange and production range, it is inferred that the largest wrinkles become increasingly confined by the overall size of large-scale coherent velocity regions such as uniform momentum zones. The self-similarity of isosurfaces yields power-law trends in subsequent one-dimensional statistics. For instance, the theoretical 2/3 power-law exponent for the structure function can be recovered by considering the collective behaviour of numerous isosurface level sets. The results suggest that the physical presence of inertial subrange eddies is manifested in the self-similar wrinkles of isosurfaces.more » « less
-
Abstract A long‐standing question in geomorphology concerns the extent that statistical models of terrain elevations have adequate characteristics with respect to the known scaling properties of landscapes. In previous work, it has been challenging to ascribe statistical significance to metrics adopted to measure landscape properties. Here, we use a recently developed surrogate data algorithm to generate synthetic surfaces with identical elevation values to the source data set, while also preserving the value of the Hölder exponent at any point (the underpinning characteristic of a multifractal surface). Our primary source data are from a laboratory experiment on landscape evolution. This allows us to examine how the statistical properties of the surfaces evolve through time and the extent to which they depart from the simple (multi)fractal formalisms. We show that there is a strong departure that is driven by the diffusive processes in operation. The number of sub‐basins of a given channel order (for orders sufficiently small relative to the basin order) exhibits a clear increase in complexity after a steady‐state for sediment flux is established. We also study elevation data from Florida and Washington States, where the relative departure from simple multifractality is even more strongly expressed but is similar for two very different locations. Our results show that at the very least, the minimum complexity for a stochastic model for terrain statistics with appropriate geomorphic scalings needs to incorporate a conditioning between the pointwise Hölder exponents and elevation.more » « less
-
Over the past two decades, the study of self-similarity and fractality in discrete structures, particularly complex networks, has gained momentum. This surge of interest is fueled by the theoretical developments within the theory of complex networks and the practical demands of real-world applications. Nonetheless, translating the principles of fractal geometry from the domain of general topology, dealing with continuous or infinite objects, to finite structures in a mathematically rigorous way poses a formidable challenge. In this paper, we overview such a theory that allows to identify and analyze fractal networks through the innate methodologies of graph theory and combinatorics. It establishes the direct graph-theoretical analogs of topological (Lebesgue) and fractal (Hausdorff) dimensions in a way that naturally links them to combinatorial parameters that have been studied within the realm of graph theory for decades. This allows to demonstrate that the self-similarity in networks is defined by the patterns of intersection among densely connected network communities. Moreover, the theory bridges discrete and continuous definitions by demonstrating how the combinatorial characterization of Lebesgue dimension via graph representation by its subsets (subgraphs/communities) extends to general topological spaces. Using this framework, we rigorously define fractal networks and connect their properties with established combinatorial concepts, such as graph colorings and descriptive complexity. The theoretical framework surveyed here sets a foundation for applications to real-life networks and future studies of fractal characteristics of complex networks using combinatorial methods and algorithms.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1115/DETC2023-117063
