Planar Point Sets Determine Many Pairwise Crossing Segments

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: J\'anos Pach, Natan Rubin, and G\'abor Tardos

Journal title: 51st ACM Symposium on Theory of Computing

Journal publisher: Association for Computing Machinery

Published year: 2019