An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points
Resumen
En este artículo mejoramos ligeramente la hasta ahora mejor cota inferior para el máximo número de bisectores sobre los posibles conjuntos de 32 puntos en el plano In this paper we give a recursive lower bound on the maximum number of halving lines for sets in the plane and as a consequence we improve the current best lower bound on the maximum number of halving lines for sets in the plane with 32 points
An improvement of the lower bound on the maximum number of halving lines
in planar sets with 32 points
Palabras Clave
Geometría Combinatoria, Bisectores, crossing number, optimizaciónCombinatorial Geometry, Halving lines, Rectilinear Crossing number, Optimization