TOPICS
Search

Point Picking


Point picking is the selection of points at random from a specified set.

Let R be a convex set in the plane that is also a closed set and a bounded set, with positive area. If A^__R denotes the mean area of a triangle whose vertices are chosen independently by uniform sampling from R, divided by the area of R, then A^__(T(R))=A^__R for any nonsingular affine transformation T of the plane.


See also

18-Point Problem, Ball Line Picking, Ball Triangle Picking, Cube Line Picking, Cube Point Picking, Cube Tetrahedron Picking, Cube Triangle Picking, Cylinder Point Picking, Discrepancy Theorem, Disk Line Picking, Disk Point Picking, Disk Triangle Picking, Happy End Problem, Line Line Picking, Line Point Picking, Line Segment Picking, Planar Distance, Simplex Simplex Picking, Sphere Line Picking, Sphere Point Picking, Sphere Tetrahedron Picking, Sylvester's Four-Point Problem, Tetrahedron Picking, Triangle Picking, Triangle Point Picking, Uniform Sampling

Explore with Wolfram|Alpha

References

Pfiefer, R. E. "The Historical Development of J. J. Sylvester's Four Point Problem." Math. Mag. 62, 309-317, 1989.

Referenced on Wolfram|Alpha

Point Picking

Cite this as:

Weisstein, Eric W. "Point Picking." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PointPicking.html

Subject classifications