Skip to Main content Skip to Navigation
Conference papers

Consistent Sets of Lines with no Colorful Incidence

Abstract : 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.
Complete list of metadata
Contributor : Xavier Goaoc Connect in order to contact the contributor
Submitted on : Tuesday, March 27, 2018 - 10:19:28 AM
Last modification on : Wednesday, June 8, 2022 - 12:50:06 PM

Links full text


  • HAL Id : hal-01744125, version 1
  • ARXIV : 1803.06267


Boris Bukh, Xavier Goaoc, Alfredo Hubard, Matthew Trager. Consistent Sets of Lines with no Colorful Incidence. SoCG 2018 - 34thInternational Symposium on Computational Geometry, Jun 2018, Budapest, Hungary. pp.1-20. ⟨hal-01744125⟩



Record views