Concept

Line–line intersection

Publications associées (35)

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

Impact of axions on confinement in three and two dimensions

In this paper we discuss well-known three- and two-dimensional models with confinement, namely, the Polyakov compact electrodynamics in 3D and two-dimensional CP(N-1) sigma model, and reveal changes in the confining regimes of these models upon adding the ...

Amer Physical Soc2015

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Bartosz Maria Walczak, Michal Lason

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of com ...

Springer2014

Crowding and grouping: how much time is needed to process good Gestalt?

Michael Herzog, Mauro Manassi

In crowding, perception of a target is deteriorated by flanking elements. Crowding is usually explained by pooling models where target and flanker signals are averaged. We show here that crowding is rather determined by grouping and good Gestalt. We determ ...

2013

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors

Bartosz Maria Walczak

Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). ...

2013

Consistent Digital Line Segments

Doemoetoer Palvoelgyi

We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from any total order o ...

2012

How grouping determines crowding

Michael Herzog, Bilge Sayim, Mauro Manassi

The spacing between target and flankers is one of the main factors of crowding. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...

2011

When bigger is better

Michael Herzog, Bilge Sayim, Mauro Manassi

One of the main factors of crowding is the spacing between target and flankers. The closer the flankers are to the target, the stronger is crowding. Recently, it was proposed that crowding strength is determined by the distance between target and flanker c ...

2011

Quantum fluctuations of one-dimensional free fermions and Fisher-Hartwig formula for Toeplitz determinants

We revisit the problem of finding the probability distribution of a fermionic number of one-dimensional spinless free fermions on a segment of a given length. The generating function for this probability distribution can be expressed as a determinant of a ...

2011

Fine Sediment release from a reservoir by controlled hydrodynamic mixing

Anton Schleiss, Giovanni De Cesare, Jolanda Maria Isabella Jenzer Althaus

Reservoir sedimentation is worldwide a problem and requires a sustainable solution. The idea of maintaining sediment in suspension by a jet induced artificial turbulence and releasing it through the water intake was tested in laboratory experiments. Theref ...

2011

Tangencies between families of disjoint regions in the plane

János Pach

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...

2010