Computational Geometry

We consider an extension of a question of Erdős on the number of k-gons in a set of n points in the plane. Relaxing the convexity restriction we obtain results on 5-gons and 5-holes (empty 5-gons). In particular, we show a direct relation between the number of non-convex 5-gons and the rectilinear crossing number, provide an improved lower bound for the number of convex 5-holes any point set must contain, and prove that the number of general 5-holes is asymptotically maximized for point sets in convex position.

[1]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[2]  János Pach,et al.  Unavoidable Configurations in Complete Topological Graphs , 2000, GD.

[3]  Matias Korman.  Theory and applications of geometric optimization problems in rectilinear metric spaces , 2009 .

[4]  David Avis,et al.  Reverse Search for Enumeration , 1996, Discret. Appl. Math..

[5]  Monty Newborn,et al.  Optimal crossing-free Hamiltonian circuit drawings of Kn , 1980, J. Comb. Theory, Ser. B.

[6]  José Miguel Díaz-Báñez,et al.  Continuous location of dimensional structures , 2004, Eur. J. Oper. Res..

[7]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[8]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[9]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[10]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[11]  Yin-Te Tsai,et al.  A fast algorithm for the alpha-connected two-center decision problem , 2003, Inf. Process. Lett..

[12]  Antonio M. Rodríguez-Chía,et al.  Simultaneous location of a service facility and a rapid transit line , 2011, Comput. Oper. Res..

[13]  Matias Korman,et al.  Optimal Insertion of a Segment Highway in a City Metric , 2008, COCOON.

[14]  Gilbert Laporte,et al.  Optimization methods for the planning of rapid transit systems , 2000, Eur. J. Oper. Res..

[15]  Louis V. Quintas,et al.  On Some Properties of Shortest Hamiltonian Circuits , 1965 .

[16]  Jin Akiyama,et al.  Dudeney Dissection of Polygons , 1998, JCDCG.

[17]  Frank Plastria,et al.  Continuous Location Problems , 1995 .

[18]  Jorge Urrutia,et al.  Simple alternating path problem , 1990, Discret. Math..

[19]  Godfried T. Toussaint,et al.  Computational geometry and facility location , 1990 .

[20]  Marc Noy,et al.  Graphs of Non-Crossing Perfect Matchings , 2002, Graphs Comb..

[21]  János Pach,et al.  Long Alternating Paths in Bicolored Point Sets , 2004, Graph Drawing.

[22]  Martin Klazar,et al.  Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs , 2000, Electron. J. Comb..

[23]  C. Lawson.  Software for C1 interpolation , 1977 .