Consistent sets of lines with no colorful incidence

03/16/2018
by   Boris Bukh, et al.
0

We consider incidences among colored sets of lines in R^d and examine whether the existence of certain concurrences between lines of k colors force the existence of at least one concurrence between lines of k+1 colors. This question is relevant for problems in 3D reconstruction in computer vision.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2020

On the Existence of Two View Chiral Reconstructions

A fundamental question in computer vision is whether a set of point pair...
research
08/21/2017

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or c...
research
09/17/2021

Level Sets or Gradient Lines? A Unifying View of Modal Clustering

The paper establishes a strong correspondence, if not an equivalence, be...
research
09/04/2017

A Geometric Approach to Harmonic Color Palette Design

We address the problem of finding harmonic colors, this problem has many...
research
02/18/2019

Modeling fonts in context of counteraction of electromagnetic eavesdropping process

Computer fonts can be one of solutions supporting a protection of inform...
research
03/08/2018

Nearly orthogonal vectors and small antipodal spherical codes

How can d+k vectors in R^d be arranged so that they are as close to orth...
research
09/07/2021

Impatient PPSZ – a Faster algorithm for CSP

PPSZ is the fastest known algorithm for (d,k)-CSP problems, for most val...

Please sign up or login with your details

Forgot password? Click here to reset