Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
The basic concepts of a deterministic scheme for simulating grain growth or foam coarsening in two dimensions have been presented in Part I. Implementation of the corresponding Laguerre (or weighted Voronoi) diagram in computer manageable practical terms i ...
The basic concepts of a deterministic model for simulating grain growth or foam coarsening in two dimensions are presented, and the fundamental tools necessary for its implementation into computer codes are provided. It is assumed that the actual cell stru ...
Polycrytalline structures are modeled via dynamically envolving power i.e. Laguerre diagrams in the three dimensional flat torus. Generating sites follow motion equations resulting from total (interface) enregy minimization., this results in an evolution o ...
The organization of refurbishment is a complex problem involving both physical and social constraints. Our purpose is to develop a computer aided tool to schedule renovation tasks. This paper presents an original methodology to generate and schedule renova ...
To investigate morphogenesis and in particular circularization mechanisms in young mycelia, we observe cultures of the zygomycete Mucor spinosus and develop discrete models of two-dimensional filamental branching growth. The models are based on the hypothe ...
We present a simple constructive heuristic for the optimal enclosed area polygon problem. Namely, given a finite set S of points in the plane, we look for the simple polygon with vertex set S having minimal, respectively maximal, enclosed area. ...
The 2-D Laguerre model of the grain growth process as the evolution of a simple convex polygonal complex is generalized to the case of a heterogeneus system. Due to the existence of several types of grains in the system, the specific grain boundary energy ...
We present an O(p*n) algorithm for the problem of finding disjoint simple paths of minimum total length between p given pairs of terminals on oriented partial 2-trees with n nodes and positive or negative arc lengths. The algorithm is in O(n) if all termin ...
In this paper, we investigate the applicability of backtrack technique for solving the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtra ...
