Concept

Centre du triangle

Publications associées (18)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the boundedness of n-folds with κ(X) = n - 1

Stefano Filipazzi

In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...

European Mathematical Soc-Ems2024

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

Interactive Generation of Calligraphic Trajectories from Gaussian Mixtures

Sylvain Calinon

The chapter presents an approach for the interactive definition of curves and motion paths based on Gaussian mixture model (GMM) and optimal control. The input of our method is a mixture of multivariate Gaussians defined by the user, whose centers define a ...

Springer2019

Reuse in Architecture & Structural Design

Jan Friedrich Georg Brütting

Introduction The construction industry has an extensive impact on the global environment and will be facing three big challenges in the next decades: reducing its resource consumption, decreasing its energy use, and limiting its waste production. This is e ...

2018

Novel Algorithms For Clustering

James Peter Newling

Clustering is a method for discovering structure in data, widely used across many scientific disciplines. The two main clustering problems this dissertation considers are K-means and K-medoids. These are NP-hard problems in the number of samples and cluste ...

EPFL2018

On Simplices in Diameter Graphs in R-4

Andrei Kupavskii

A graph G is a diameter graph in R-d if its vertex set is a finite subset in R-d of diameter 1 and edges join pairs of vertices a unit distance apart. It is shown that if a diameter graph G in R-4 contains the complete subgraph K on five vertices, then any ...

Maik Nauka/Interperiodica/Springer2017

Mixed strain-displacement finite elements for landslide and avalanche release prediction

Lorenzo Benedetti

Determination of the initial detaching volume is one of the major challenges in snow avalanche and debris flow forecast. Soil liquefaction due to loss of cohesion results in landslides, whereas quasi-brittle failure triggers the release of snow avalanches. ...

2015

Mixed stabilized finite element methods in nonlinear solid mechanics. Part III: Compressible and incompressible plasticity

Lorenzo Benedetti

This paper presents the application of a stabilized mixed strain/displacement finite element formulation for the solution of nonlinear solid mechanics problems involving compressible and incompressible plasticity. The variational multiscale stabilization i ...

Elsevier2015

Stability Results For The Volume Of Random Simplices

Gergely Ambrus

It is known that for a convex body K in R-d of volume one, the expected volume of random simplices in K is minimized if K is an ellipsoid, and for d = 2, maximized if K is a triangle. Here we provide corresponding stability estimates. ...

Johns Hopkins Univ Press2014

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014