abstract
-
There are three main thrusts to this article: a new proof of Levi%27s Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that pseudolinear and convex drawings of Kn have n2%2b O(n log n) and O(n2), respectively, empty triangles. All the arguments are elementary, algorithmic, and self-contained. © 2017 Wiley Periodicals, Inc.
-
There are three main thrusts to this article: a new proof of Levi's Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that pseudolinear and convex drawings of Kn have n2%2b O(n log n) and O(n2), respectively, empty triangles. All the arguments are elementary, algorithmic, and self-contained. © 2017 Wiley Periodicals, Inc.
... more
