Related papers: Generating Random Hyperfractal Cities
At large scales, typologies of urban form and corresponding generating processes remain an open question with important implications regarding urban planning policies and sustainability. We propose in this paper to generate urban…
Identification of cracks is essential to assess the structural integrity of concrete infrastructure. However, robust crack segmentation remains a challenging task for computer vision systems due to the diverse appearance of concrete…
City size distributions are known to be well approximated by power laws across a wide range of countries. But such distributions are also meaningful at other spatial scales, such as within certain regions of a country. Using data from…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
Network percolation has recently been proposed as a method to characterize the global structure of an urban system form the bottom-up. This paper proposes to extend urban network percolation in a multi-dimensional way, to take into account…
The Boltzmann model for the random generation of "decomposable" combinatorial structures is a set of techniques that allows for efficient random sampling algorithms for a large class of families of discrete objects. The usual requirement of…
We propose and test a model that describes the morphology of cities, the scaling of the urban perimeter of individual cities, and the area distribution of systems of cities. The model is also consistent with observable urban growth…
Many models of fractal growth patterns (like Diffusion Limited Aggregation and Dielectric Breakdown Models) combine complex geometry with randomness; this double difficulty is a stumbling block to their elucidation. In this paper we…
In this paper, we propose a simple but effective method for fast image segmentation. We re-examine the locality-preserving character of spectral clustering by constructing a graph over image regions with both global and local connections.…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
Traffic networks have been proved to be fractal systems. However, previous studies mainly focused on monofractal networks, while complex systems are of multifractal structure. This paper is devoted to exploring the general regularities of…
The term fractal describes a class of complex structures exhibiting self-similarity across different scales. Fractal patterns can be created by using various techniques such as finite subdivision rules and iterated function systems. In this…
Since a spatial distribution of communication requests is inhomogeneous and related to a population, in constructing a network, it is crucial for delivering packets on short paths through the links between proximity nodes and for…
Streets networks provide an invaluable source of information about the different temporal and spatial patterns emerging in our cities. These streets are often represented as graphs where intersections are modelled as nodes and streets as…
We consider the general character of the spatial distribution of a population that grows through reproduction and subsequent local resettlement of new population members. We present several simple one and two-dimensional point placement…
The improved city clustering algorithm can be used to identify urban boundaries on a digital map, and the results are a set of isolines. The relationships between the urban measurements within the variable boundaries follow allometric…
Traffic is constrained by the information involved in locating the receiver and the physical distance between sender and receiver. We here focus on the former, and investigate traffic in the perspective of information handling. We re-plot…
A class of random graph models is considered, combining features of exponential-family models and latent structure models, with the goal of retaining the strengths of both of them while reducing the weaknesses of each of them. An open…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
The iterative random subdivision of rectangles is used as a generation model of networks in physics, computer science, and urban planning. However, these researches were independent. We consider some relations in them, and derive…