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.
A dominating set D of a graph G is a set such that each vertex v of G is either in the set or adjacent to a vertex in the set. Matheson and Tarjan (1996) proved that any n-vertex plane triangulation has a dominating set of size at most n/3, and conjectured ...
2010
In recent years, freeform shapes are gaining more and more popularity in architecture. Such shapes are often challenging to manufacture, and have motivated an active research field called architectural geometry. In this thesis, we investigate patterns of s ...
Vienna University of Technology2011
,
Definitions of flow indicators are derived by adapting Edie's definitions through a stream-based approach and a data-driven spatio-temporal discretization framework. The stream-based approach accounts for the multidirectional nature of pedestrian flows. Th ...
We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a well-known memory ...
Constrained meshes play an important role in freeform architectural design, as they can represent panel layouts on freeform surfaces. It is challenging to perform realtime manipulation on such meshes, because all constraints need to be respected during the ...
We propose a novel approach to pedestrian flow characterization. The definitions of density, flow and velocity existing in the literature are extended through a data-driven spatio-temporal discretization framework. The framework is based on three-dimension ...
We propose a novel approach to pedestrian flow characterization. The definitions of density, flow and velocity existing in the literature are extended through a data-driven spatio-temporal discretization framework. The framework is based on three-dimension ...
We present a novel approach to remesh a surface into an isotropic triangular or quad-dominant mesh using a unified local smoothing operator that optimizes both the edge orientations and vertex positions in the output mesh. Our algorithm produces meshes wit ...
This paper, as the sequel to previous work, develops numerical schemes for fractional diffusion equations on a two-dimensional finite domain with tri- angular meshes. We adopt the nodal discontinuous Galerkin methods for the full spatial discretization by ...
Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence, that this vertex set admits 92487256 triangulations, partitioned into 247451 symmetry classes. ...
