Publication

Cross-sections of line configurations in R-3 and (d-2)-flat configurations in R-d

Related publications (56)

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.

Unsplittable coverings in the plane

János Pach

A system of sets forms an m-fold covering of a set X if every point of X belongs to at least m of its members. A 1-fold covering is called a covering. The problem of splitting multiple coverings into several coverings was motivated by classical density est ...

Academic Press Inc Elsevier Science2016

Unsplittable Coverings in the Plane

János Pach

Springer-Verlag Berlin2016

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

Multi-Label Answer Aggregation for Crowdsourcing

Thành Tâm Nguyên

Crowdsourcing has been widely established as a means to enable human computation at large scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...

2016

On Minimal Trajectories for Mobile Sampling of Bandlimited Fields

Martin Vetterli, Jayakrishnan Unnikrishnan

We study the design of sampling trajectories for stable sampling and the reconstruction of bandlimited spatial fields using mobile sensors. The spectrum is assumed to be a symmetric convex set. As a performance metric we use the path density of the set of ...

Elsevier2015

Double-Normal Pairs In Space

János Pach

A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...

London Mathematical Society, Cambridge2015

A note on coloring line arrangements

János Pach, Rom Pinchasi

We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...

Electronic Journal Of Combinatorics2014

The visible perimeter of an arrangement of disks

János Pach, Gábor Tardos, Gabriel Nivasch

Given a collection of n opaque unit disks in the plane, we want to find a stacking order for them that maximizes their visible perimeter, the total length of all pieces of their boundaries visible from above. We prove that if the centers of the disks form ...

Elsevier Science Bv2014

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Chiese provvisorie. Identità sospesa

Chiara Monterumisi

This book is the result of a choral participation (School of Doctorate Studies in Architecture, University of Bologna and Laboratorio “Ricerca Emilia”) in the exhibition entitled “Architetture padane”. It is also the second step of wider investigation focu ...

CLUEB2013