Add to ORKGYou are given 2n+3 points (n ≥ 1) in the plane, no three on a line and no four on a circle. By using random points, this Demonstration shows that you can find a circle C passing through three of them (in red) such that, of the remaining 2n points, n are in the interior (in yellow) and n are in the exterior (in blue) of CEnsino Médio::Matemátic
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at t...
Given two sets of points ℝ and double-struck B in the plane, we address the problem of finding a set...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
[[abstract]]Given n demand points in the plane, the circle connecting problem (CCP) is to locate n c...
Knowledge about GeometryThree noncollinear points determine a circle. In this Demonstration, you can...
In this paper we deal with the following problem: Given a set B consisting of n points, not all on a...
In the first part of this research we find an improvement to Huxley and Konyagin's current lower bou...
AbstractErdős and Purdy ask how many points can be chosen from the n × n-grid with no four of them o...
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n...
AbstractNeumann-Lara and Urrutia showed in 1985 that in any set of n points in the plane in general ...
A circle C is occluded by a set of circles C1; : : : ;Cn if every line that intersects C also inters...
Given a set P of n points in the plane, the two-circle point- labeling problem consists of placing 2...
The Shrinking Circle Problem is an example of a simple-to-state geometry problem that is visually ap...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at t...
Given two sets of points ℝ and double-struck B in the plane, we address the problem of finding a set...
Abstract: We provide an optimal strategy to solve the n X n X n points problem inside the box, consi...
[[abstract]]Given n demand points in the plane, the circle connecting problem (CCP) is to locate n c...
Knowledge about GeometryThree noncollinear points determine a circle. In this Demonstration, you can...
In this paper we deal with the following problem: Given a set B consisting of n points, not all on a...
In the first part of this research we find an improvement to Huxley and Konyagin's current lower bou...
AbstractErdős and Purdy ask how many points can be chosen from the n × n-grid with no four of them o...
Given a set P of n points in the plane, the two-circle point-labeling problem consists of placing 2n...
AbstractNeumann-Lara and Urrutia showed in 1985 that in any set of n points in the plane in general ...
A circle C is occluded by a set of circles C1; : : : ;Cn if every line that intersects C also inters...
Given a set P of n points in the plane, the two-circle point- labeling problem consists of placing 2...
The Shrinking Circle Problem is an example of a simple-to-state geometry problem that is visually ap...
A halving line of a set of points is a line that divides the set of points into two equal parts. The...
For a set P of n points in the plane and an integer k ≤ n, consider the problem of finding the small...
Count the number of lattice points N(r) inside the boundary of a circle of radius r with center at t...