We used a genetic search algorithm to find sets of points with many halving lines. There are sets of 10 points with 13 halving lines, 12 points with 18 halving lines, 14 points with 22 halving lines, 16 points with 27 halving lines, and 18 points with 32 halving lines. We find a construction generalizing the 12 point configuration and show that, for any n = 3 · 2^i, there are configurations of n points with n log_4 (2n/3) = 3(i + 1)2^i-1 halving lines
NoneA set of lines passing through a finite set of points is called a configuration. The term orchar...
AbstractMany properties of finite point sets only depend on the relative position of the points, e.g...
Given a set of n points in the plane and a collection of k halving lines of P ℓ1,..., ℓk indexed acc...
AbstractGiven a set of n points in general position in the plane, where n is even, a halving line is...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
Abstract. We construct, for every even n, a set of n points in the plane that generates Ω ne √ ln 4 ...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
AbstractRecently, Aichholzer, García, Orden, and Ramos derived a remarkably improved lower bound for...
For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving...
Abstract. We study generalized point – line configurations and their properties in the projec-tive p...
Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line...
We show that a polynomial time algorithm exists to find all integer sequences with a given autocorre...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
You are given 2n+3 points (n ≥ 1) in the plane, no three on a line and no four on a circle. By using...
NoneA set of lines passing through a finite set of points is called a configuration. The term orchar...
AbstractMany properties of finite point sets only depend on the relative position of the points, e.g...
Given a set of n points in the plane and a collection of k halving lines of P ℓ1,..., ℓk indexed acc...
AbstractGiven a set of n points in general position in the plane, where n is even, a halving line is...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
Abstract. We construct, for every even n, a set of n points in the plane that generates Ω ne √ ln 4 ...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
AbstractRecently, Aichholzer, García, Orden, and Ramos derived a remarkably improved lower bound for...
For n ≤ 27 we present exact values for the maximum number h(n) of halving lines and eh(n) of halving...
Abstract. We study generalized point – line configurations and their properties in the projec-tive p...
Fix an n ≥ 3. Consider the following two operations: given a line with a specified point on the line...
We show that a polynomial time algorithm exists to find all integer sequences with a given autocorre...
If a configuration of m triangles in the plane has only n points as vertices, then there must be a s...
We present new algorithms for computing many faces in arrangements of lines and segments. Given a se...
You are given 2n+3 points (n ≥ 1) in the plane, no three on a line and no four on a circle. By using...
NoneA set of lines passing through a finite set of points is called a configuration. The term orchar...
AbstractMany properties of finite point sets only depend on the relative position of the points, e.g...
Given a set of n points in the plane and a collection of k halving lines of P ℓ1,..., ℓk indexed acc...