We present a framework for generating street networks and parcel layouts. Our goal is the generation of high-quality layouts that can be used for urban planning and virtual environments. We propose a solution based on hierarchical domain splitting using two splitting types: streamline-based splitting, which splits a region along one or multiple streamlines of a cross field, and template-based splitting, which warps pre-designed templates to a region and uses the interior geometry of the template as the splitting lines. We combine these two splitting approaches into a hierarchical framework, providing automatic and interactive tools to explore the design space.

No abstract uploaded!

In a former paper we proposed a model for the quantization of gravity by working in a bundle $E$ where we realized the Hamilton constraint as the Wheeler-DeWitt equation. However, the corresponding operator only acts in the fibers and not in the base space. Therefore, we now discard the Wheeler-DeWitt equation and express the Hamilton constraint differently, either with the help of the Hamilton equations or by employing a geometric evolution equation. There are two possible modifications possible which both are equivalent to the Hamilton constraint and which lead to two new models. In the first model we obtain a hyperbolic operator that acts in the fibers as well as in the base space and we can construct a symplectic vector space and a Weyl system. In the second model the resulting equation is a wave equation in $\so \times (0,\infty)$ valid in points $(x,t,\xi)$ in $E$ and we look for solutions for each fixed $\xi$. This set of equations contains as a special case the equation of a quantized cosmological Friedman universe without matter but with a cosmological constant, when we look for solutions which only depend on $t$. Moreover, in case $\so$ is compact we prove a spectral resolution of the equation.

No abstract uploaded!

An order 3 magic hexagon resembles the shape of a 19-cell honeycomb, arranged in a 3 4 5 4 3 manner. The requirement is to fill the numbers 1-19 in the grids so that each row (15 in total) adds up to 38. Previously invented methods aimed at solving this problem and proving its uniqueness were either not rigorous enough or too intricate. So by analyzing its properties, I wanted to find a combinatorial solution to its construction, prove its uniqueness, and investigate whether its mathematical principles can be used in real-world applications. The difficulty depends on the viewpoint, so the first step was to label each grid in a convenient way. I chose to look at the magic hexagon as a network composed of a center and rings. Then the connections and restrictions of each number set could be found by formula derivation. In a similar fashion, symmetrical properties were also found. The next step was to analyze possible distributions of odd and even numbers. Out of the 9 configurations, only 1 proved to be usable. The final step was construction. With all the properties known, the few impossibilities were easily eliminated, and only one solution remained, thus proving its uniqueness. The procedures used on the order 3 magic hexagon may be extended to those of higher orders, providing more ease in their construction. The unique properties of magic hexagons may be used in some fields of application, such as in password systems, large-scale roof structure, composite material, national security systems and many other fields.