Related publications (30)

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Rom Pinchasi

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...
Electronic Journal Of Combinatorics2024

Post stroke recovery prediction

Dimitri Nestor Alice Van De Ville, Elvira Pirondini, Cyprien Alban Félicien Rivier

The present relates to a method for generating a graph representing a virtually lesioned connectome of a patient after a stroke comprising:- providing structural data of the brain of the patient after the stroke;- segmenting said structural data to delinea ...
2024

Reduced order modelling of nonaffine problems on parameterized NURBS multipatch geometries

Annalisa Buffa, Pablo Antolin Sanchez, Margarita Chasapi

This contribution explores the combined capabilities of reduced basis methods and IsoGeometric Analysis (IGA) in the context of parameterized partial differential equations. The introduction of IGA enables a unified simulation framework based on a single g ...
2022

Multi-planar geometry and latent image recovery from a single motion-blurred image

Subeesh Vasu

Existing works for depth estimation and image deblurring in the presence of depth-dependent blur work with the assumption of a multi-layered scene wherein each layer is modeled in the form of a fronto-parallel plane. In this work, we attempt to relax these ...
SPRINGER2022

Robust numerical integration on curved polyhedra based on folded decompositions

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces correspond to the g ...
ELSEVIER SCIENCE SA2022

ON THE DESIGN AND OPTIMIZATION OF WIDE ANGLE DIFFRACTIVE OPTICAL ELEMENTS

Dong Cheon Kim

Diffractive optical elements (DOEs) which consist of microstructure surface relief permit the generation of the spatial distribution of light beams by using a single element. Due to their compact size, design flexibility, and mass productivity, they are us ...
EPFL2021

Shake table test of a masonry building retrofitted with shotcrete

Katrin Beyer, Kiarash Mohtasham Dolatshahi

This paper presents the results of a series of shake table tests carried out on a half-scale single-story unreinforced masonry building with asymmetric openings. First, the unretrofitted building is subjected to seven increasing steps of bidirectional seis ...
ELSEVIER SCI LTD2020

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

Mikhail Kapralov, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakab Tardos

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...
ASSOC COMPUTING MACHINERY2020

Thrackles: An improved upper bound

János Pach, Radoslav Fulek

A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, ex ...
ELSEVIER SCIENCE BV2019

On the Rainbow Turan number of paths

Abhishek Methuku

Let F be a fixed graph. The rainbow Turan number of F is defined as the maximum number of edges in a graph on n vertices that has a proper edge-coloring with no rainbow copy of F (i.e., a copy of F all of whose edges have different colours). The systematic ...
ELECTRONIC JOURNAL OF COMBINATORICS2019

Graph Chatbot

Chat with Graph Search

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.