Search results
Results from the WOW.Com Content Network
The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.
circle division by chords: Image title: Illustration of the number of points (n), chords (c) and regions (rG) for first six terms of Moser's circle problem (OEIS A000127) by CMG Lee. Width: 100%: Height: 100%
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
The four quadrants of a Cartesian coordinate system. The axes of a two-dimensional Cartesian system divide the plane into four infinite regions, called quadrants, each bounded by two half-axes.
Dividing a circle into areas; Metadata. This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.
Chord: a line segment whose endpoints lie on the circle, thus dividing a circle into two segments. Circumference: the length of one circuit along the circle, or the distance around the circle. Diameter: a line segment whose endpoints lie on the circle and that passes through the centre; or the length of such a line segment. This is the largest ...
Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!
Let H = {h 1, h 2, ..., h k} be the convex hull of P; then the farthest-point Voronoi diagram is a subdivision of the plane into k cells, one for each point in H, with the property that a point q lies in the cell corresponding to a site h i if and only if d(q, h i) > d(q, p j) for each p j ∈ S with h i ≠ p j, where d(p, q) is the Euclidean ...