Chapter Two concerns a strong form of the dual of Sylvester's problem in the affine plane. The main result of the chapter is that in an arrangement of n lines in the affine plane, not all of which are parallel, and not all of which pass through a common point, there must be at least 2n-37 affine ordinary points as long as n an 6.In 1980 Goodman [37] came up with a nice way of compactly visualizing pseudoline arrangements using so-called wiring diagrams. A sample wiring diagram, taken from [32], is given in Figure 1.77. We consider here just simple pseudolineanbsp;...

Title | : | Sylvester-Gallai Results and Other Contributions to Combinatorial and Computational Geometry |

Author | : | Jonathan Lenchner |

Publisher | : | ProQuest - 2008 |

Continue