Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Circle packing theorem

Related publications (13)

Suppressing tip vortex cavitation by winglets

Mohamed Farhat, Ali Amini, Martino Reclari

Despite the numerous remedies prescribed so far, tip vortex cavitation (TVC) remains a major issue in design and operation of diverse applications. In this paper, we experimentally investigate the effectiveness of winglets in suppressing TVC. An elliptical ...

SPRINGER2019

Graph-Based Detection of Seams In 360-Degree Images

Pascal Frossard, Francesca De Simone, Roberto Gerson De Albuquerque Azevedo, Sohyeong Kim

In this paper, we propose an algorithm to detect a specific kind of distortions, referred to as seams, which commonly occur when a 360-degree image is represented in planar domain by projecting the sphere to a polyhedron, e.g, via the Cube Map (CM) project ...

2019

Rate Distortion Optimized Graph Partitioning for Omnidirectional Image Coding

Pascal Frossard, Francesca De Simone, Thomas Maugey

Omnidirectional images are spherical signals captured by cameras with 360-degree field of view. In order to be compressed using existing encoders, these signals are mapped to planar domain. A commonly used planar representation is the equirectangular one, ...

IEEE COMPUTER SOC2018

Finding Perfect Matchings in Bipartite Hypergraphs

Chidambaram Annamalai

Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the existence of a perf ...

Springer-Verlag2018

Handheld reflectance acquisition of paintings

Martin Vetterli, Sabine Süsstrunk, Loïc Arnaud Baboulaz, Niranjan Thanikachalam, Damien Firmenich

Relightable photographs are alternatives to traditional photographs as they provide a richer viewing experience. However, the complex acquisition systems of existing techniques have restricted its usage to specialized setups. We introduce an easy-to-use an ...

Ieee-Inst Electrical Electronics Engineers Inc2017

On the Zarankiewicz problem for intersection hypergraphs

János Pach

Let d and t be fixed positive integers, and let denote the complete d-partite hypergraph with t vertices in each of its parts, whose hyperedges are the d-tuples of the vertex set with precisely one element from each part. According to a fundamental theorem ...

Academic Press Inc Elsevier Science2016

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Maria Walczak

Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...

Cambridge Univ Press2016

From data to structures : graph learning under smoothness assumptions and applications in data science

Vasilis Kalofolias

Weighted undirected graphs are a simple, yet powerful way to encode structure in data. A first question we need to address regarding such graphs is how to use them effectively to enhance machine learning problems. A second but more important question is ho ...

EPFL2016

Coloring Relatives of Interval Overlap Graphs via On-line Games

Bartosz Maria Walczak

The main goal of this paper is to formalize and explore a connection between chromatic properties of graphs defined by geometric representations and competitivity analysis of on-line algorithms. This connection became apparent after the recent construction ...

Springer-Verlag Berlin2014

Vision-Based Scene Understanding with Sparsity Promoting Priors

Alexandre Massoud Alahi

Human beings are interested in understanding their environments and the dynamic content that fills their surroundings. For applications ranging from security to marketing, people have installed networks of cameras to capture the dynamic elements of scenes. ...

EPFL2011

Information Processing and Structure of Dynamical Networks

Ali Ajdari Rad

Networks are everywhere and we are confronted with many networks in our daily life. Networks such as Internet, World Wide Web, social, biological and economical networks have been subject to extensive studies in the last decade. The volume of publications ...

EPFL2011

A separator theorem for string graphs and its applications

János Pach

A string graph is the intersection graph of a collection of continuous arcs in the plane. We show that any string graph with in edges can be separated into two parts of roughly equal size by the removal of O(m(3/4)root log m) vertices. This result is then ...

Cambridge University Press2010

A separator theorem for string graphs and its applications

János Pach

Springer2009

Related publications (13)