arXiv subjects

Florian Rist

Publications and source records attributed to Florian Rist.

10 recordsLinked to original sources

arXiv2024

FlameForge: Combustion of Generalized Wooden Structures

We propose a unified volumetric combustion simulator that supports general wooden structures capturing the multi-phase combustion of charring materials. Complex geometric structures can conveniently be represented in a voxel grid for the effective evaluation of volumetric effects. In addition, a signed distance field is introduced to efficiently query the surface information required to compute the insulating effect caused by the char layer. Non-charring materials such as acrylic glass or non-combustible materials such as stone can also be modeled in the simulator. Adaptive data structures are utilized to enable memory-efficient computations within our multiresolution approach. The simulator is qualitatively validated by showcasing the numerical simulation of a variety of scenes covering different kinds of structural configurations and materials. Two-way coupling of our combustion simulator and position-based dynamics is demonstrated capturing characteristic mechanical deformations caused by the combustion process. The volumetric combustion process of wooden structures is further quantitatively assessed by comparing our simulated results to sub-surface measurements of a real-world combustion experiment.

cs.GR↗

arXiv2024

View-Independent Adjoint Light Tracing for Lighting Design Optimization

Differentiable rendering methods promise the ability to optimize various parameters of 3d scenes to achieve a desired result. However, lighting design has so far received little attention in this field. In this paper, we introduce a method that enables continuous optimization of the arrangement of luminaires in a 3d scene via differentiable light tracing. Our experiments show two major issues when attempting to apply existing methods from differentiable path tracing to this problem: first, many rendering methods produce images, which restricts the ability of a designer to define lighting objectives to image space. Second, most previous methods are designed for scene geometry or material optimization and have not been extensively tested for the case of optimizing light sources. Currently available differentiable ray-tracing methods do not provide satisfactory performance, even on fairly basic test cases in our experience. In this paper, we propose a novel adjoint light tracing method that overcomes these challenges and enables gradient-based lighting design optimization in a view-independent (camera-free) way. Thus, we allow the user to paint illumination targets directly onto the 3d scene or use existing baked illumination data (e.g., light maps). Using modern ray-tracing hardware, we achieve interactive performance. We find light tracing advantageous over path tracing in this setting, as it naturally handles irregular geometry, resulting in less noise and improved optimization convergence. We compare our adjoint gradients to state-of-the-art image-based differentiable rendering methods. We also demonstrate that our gradient data works with various common optimization algorithms, providing good convergence behaviour. Qualitative comparisons with real-world scenes underline the practical applicability of our method.

cs.GR↗

arXiv2023

Flexible Kokotsakis Meshes with Skew Faces: Generalization of the Orthodiagonal Involutive Type

In this paper, we introduce and study a remarkable class of mechanisms formed by a $3 \times 3$ arrangement of rigid quadrilateral faces with revolute joints at the common edges. In contrast to the well-studied Kokotsakis meshes with a quadrangular base, we do not assume the planarity of the quadrilateral faces. Our mechanisms are a generalization of Izmestiev's orthodiagonal involutive type of Kokotsakis meshes formed by planar quadrilateral faces. The importance of this Izmestiev class is undisputed as it represents the first known flexible discrete surface -- T-nets -- which has been constructed by Graf and Sauer. Our algebraic approach yields a complete characterization of all flexible $3 \times 3$ quad meshes of the orthodiagonal involutive type up to some degenerated cases. It is shown that one has a maximum of 8 degrees of freedom to construct such mechanisms. This is illustrated by several examples, including cases which could not be realized using planar faces. We demonstrate the practical realization of the proposed mechanisms by building a physical prototype using stainless steel. In contrast to plastic prototype fabrication, we avoid large tolerances and inherent flexibility.

math.AG↗

arXiv2023

Developable Quad Meshes and Contact Element Nets

The property of a surface being developable can be expressed in different equivalent ways, by vanishing Gauss curvature, or by the existence of isometric mappings to planar domains. Computational contributions to this topic range from special parametrizations to discrete-isometric mappings. However, so far a local criterion expressing developability of general quad meshes has been lacking. In this paper, we propose a new and efficient discrete developability criterion that is applied to quad meshes equipped with vertex weights, and which is motivated by a well-known characterization in differential geometry, namely a rank-deficient second fundamental form. We assign contact elements to the faces of meshes and ruling vectors to the edges, which in combination yield a developability condition per face. Using standard optimization procedures, we are able to perform interactive design and developable lofting. The meshes we employ are combinatorial regular quad meshes with isolated singularities but are otherwise not required to follow any special curves on a developable surface. They are thus easily embedded into a design workflow involving standard operations like remeshing, trimming, and merging operations. An important feature is that we can directly derive a watertight, rational bi-quadratic spline surface from our meshes. Remarkably, it occurs as the limit of weighted Doo-Sabin subdivision, which acts in an interpolatory manner on contact elements.

cs.CG↗

arXiv2022

UrbanFlow: Designing Comfortable Outdoor Areas

Design decisions in urban planning have to be made with particular carefulness as the resulting constraints are binding for the whole architectural design that follows. In this context, investigating and optimizing the airflow in urban environments is critical to design comfortable outdoor areas as unwanted effects such as windy areas and the formation of heat pockets have to be avoided. Our UrbanFlow framework enables interactive architectural design allowing for decision making based on simulating urban flow. Compared to real-time fluid flow simulation, enabling interactive architecture design poses an even higher computational efficiency challenge as evaluating a design by simulation usually requires hundreds of time steps. This is addressed based on a highly efficient Eulerian fluid simulator in which we incorporate a unified porosity model which is devised to encode digital urban models containing objects such as buildings and trees. UrbanFlow is equipped with an optimization routine enabling the direct computation of design adaptations improving livability and comfort for given parameterized architectural designs. To ensure convergence of the optimization process, instead of the classical Navier-Stokes equations, the Reynolds-averaged Navier-Stokes equations are solved as this can be done on a relatively coarse grid and allows for the decoupling of the effects of turbulent eddies which are taken into account using a separate turbulence model. As we demonstrate on a real-world example taken from an ongoing architectural competition, this results in a fast convergence of the optimization process which computes a design adaptation avoiding heat pockets as well as uncomfortable windy areas.

cs.GR↗

arXiv2021

Design and Fabrication of Multi-Patch Elastic Geodesic Grid Structures

Elastic geodesic grids (EGG) are lightweight structures that can be deployed to approximate designer-provided free-form surfaces. Initially, the grids are perfectly flat, during deployment, a curved shape emerges, as grid elements bend and twist. Their layout is based on networks of geodesic curves and is found geometrically. Encoded in the planar grids is the intrinsic shape of the design surface. Such structures may serve purposes like free-form sub-structures, panels, sun and rain protectors, pavilions, etc. However, so far the EGG have only been investigated using a generic set of design surfaces and small-scale desktop models. Some limitations become apparent when considering more sophisticated design surfaces, like from free-form architecture. Due to characteristics like high local curvature or non-geodesic boundaries, they may be captured only poorly by a single EGG. We show how decomposing such surfaces into smaller patches serves as an effective strategy to tackle these problems. We furthermore show that elastic geodesic grids are in fact well suited for this approach. Finally, we present a showcase model of some meters in size and discuss practical aspects concerning fabrication, size, and easy deployment.

cs.GR↗

arXiv2020

Design and Fabrication of Elastic Geodesic Grid Structures

Elastic geodesic grids (EGG) are lightweight structures that can be easily deployed to approximate designer provided free-form surfaces. In the initial configuration the grids are perfectly flat, during deployment, though, curvature is induced to the structure, as grid elements bend and twist. Their layout is found geometrically, it is based on networks of geodesic curves on free-form design-surfaces. Generating a layout with this approach encodes an elasto-kinematic mechanism to the grid that creates the curved shape during deployment. In the final state the grid can be fixed to supports and serve for all kinds of purposes like free-form sub-structures, paneling, sun and rain protectors, pavilions, etc. However, so far these structures have only been investigated using small-scale desktop models. We investigate the scalability of such structures, presenting a medium sized model. It was designed by an architecture student without expert knowledge on elastic structures or differential geometry, just using the elastic geodesic grids design-pipeline. We further present a fabrication-process for EGG-models. They can be built quickly and with a small budget.

cs.GR↗

arXiv2020

Computational Design of Cold Bent Glass Façades

Cold bent glass is a promising and cost-efficient method for realizing doubly curved glass façades. They are produced by attaching planar glass sheets to curved frames and require keeping the occurring stress within safe limits. However, it is very challenging to navigate the design space of cold bent glass panels due to the fragility of the material, which impedes the form-finding for practically feasible and aesthetically pleasing cold bent glass façades. We propose an interactive, data-driven approach for designing cold bent glass façades that can be seamlessly integrated into a typical architectural design pipeline. Our method allows non-expert users to interactively edit a parametric surface while providing real-time feedback on the deformed shape and maximum stress of cold bent glass panels. Designs are automatically refined to minimize several fairness criteria while maximal stresses are kept within glass limits. We achieve interactive frame rates by using a differentiable Mixture Density Network trained from more than a million simulations. Given a curved boundary, our regression model is capable of handling multistable configurations and accurately predicting the equilibrium shape of the panel and its corresponding maximal stress. We show predictions are highly accurate and validate our results with a physical realization of a cold bent glass surface.

cs.GR↗

arXiv2018

An Adaptive Approach for Automated Grapevine Phenotyping using VGG-based Convolutional Neural Networks

In (grapevine) breeding programs and research, periodic phenotyping and multi-year monitoring of different grapevine traits, like growth or yield, is needed especially in the field. This demand imply objective, precise and automated methods using sensors and adaptive software. This work presents a proof-of-concept analyzing RGB images of different growth stages of grapevines with the aim to detect and quantify promising plant organs which are related to yield. The input images are segmented by a Fully Convolutional Neural Network (FCN) into object and background pixels. The objects are plant organs like young shoots, pedicels, flower buds or grapes, which are principally suitable for yield estimation. In the ground truth of the training images, each object is separately annotated as a connected segment of object pixels, which enables end-to-end learning of the object features. Based on the CNN-based segmentation, the number of objects is determined by detecting and counting connected components of object pixels using region labeling. In an evaluation on six different data sets, the system achieves an IoU of up to 87.3% for the segmentation and an F1 score of up to 88.6% for the object detection.

cs.CV↗

arXiv2018

Multi-View Semantic Labeling of 3D Point Clouds for Automated Plant Phenotyping

Semantic labeling of 3D point clouds is important for the derivation of 3D models from real world scenarios in several economic fields such as building industry, facility management, town planning or heritage conservation. In contrast to these most common applications, we describe in this study the semantic labeling of 3D point clouds derived from plant organs by high-precision scanning. Our approach is optimized for the task of plant phenotyping with its very specific challenges and is employing a deep learning framework. Thereby, we report important experiences concerning detailed parameter initialization and optimization techniques. By evaluating our approach with challenging datasets we achieve state-of-the-art results without difficult and time consuming feature engineering as being necessary in traditional approaches to semantic labeling.

cs.CV↗