Minecraft Circle Generator

Generate Minecraft circles and rings of any diameter.

Everyday Bresenham midpoint Hollow + filled
Rate this calculator · 4.0 (3)

Minecraft Circle Generator

Midpoint algorithm · 3-64 block diameter · live block count

Instructions — Minecraft Circle Generator

1

Enter a diameter

Type any integer from 3 to 64 blocks. Common sizes are presets - 7, 11, 15, 21, 25, 31, 41. Odd diameters give a single centre block; even diameters give a 2×2 centre. For towers and domes, odd is the conventional pick.

2

Pick filled or hollow

Hollow gives just the outline ring (for walls, fountain rims, tower outlines). Filled fills the disc (for floor pads, roof discs, slab platforms). The block count updates immediately.

3

Build it block by block

Use the chart as a top-down view. Place a block wherever the generator shows a filled cell. The algorithm matches what most Minecraft mapping tools (WorldEdit\'s //cyl command, MCEdit, Litematica) produce internally.

Smallest "real" circle: diameter 7. Below that the result looks more like a diamond than a circle. From 15 blocks up, circles look genuinely round in-game.
Sphere = stacked circles. For a sphere of diameter D, the layer at height y has circle diameter 2√(R² − (y − R)²), where R = D/2. Generate one circle per layer and stack them.

Formulas

Circles on a square grid require rasterization - an algorithm that picks the integer-coordinate cells closest to a continuous circle. The standard approach is the midpoint algorithm, derived from Bresenham\'s 1965 IBM Systems Journal paper.

Continuous Circle
$$ x^2 + y^2 = r^2 $$
The equation of a circle centred at the origin with radius r. Every (x, y) on the curve satisfies it. Minecraft needs the integer cells closest to this curve.
Pixel Inclusion Rule
$$ \text{cell}(x, y) = 1 \iff \sqrt{(x - c_x)^2 + (y - c_y)^2} \le r $$
A cell is part of the filled disc when its centre lies within the radius. For hollow rings, the rule additionally requires at least one neighbour outside the disc.
Midpoint Decision Function
$$ f(x, y) = x^2 + y^2 - r^2 $$
Bresenham\'s trick: evaluate f at the midpoint between two candidate pixels. Sign tells you which pixel to plot. No multiplications, no square roots, no floating point.
Approximate Block Count
$$ N_{\text{disc}} \approx \pi r^2 \;\;\;\; N_{\text{ring}} \approx 2 \pi r $$
A filled disc of diameter 21 needs about π × 10.5² ≈ 346 blocks. A ring of the same diameter needs about 66. The generator shows the exact count after rasterization.
Ellipse Equation
$$ \frac{(x - c_x)^2}{r_x^2} + \frac{(y - c_y)^2}{r_y^2} \le 1 $$
For ovals - stadiums, arenas, racetracks. Two radii instead of one. Rasterizes the same way: a cell is in the oval when its centre satisfies the inequality.
Sphere Slice Radius
$$ r_y = \sqrt{R^2 - (y - c_y)^2} $$
A sphere of radius R, sliced horizontally at height y, has a circular cross-section of radius r_y. To build a sphere, generate one circle per layer using this radius.

Reference

Block counts by diameter
DiameterRing blocksDisc blocksLook
345Cross-shape
51213Plus / diamond
72037Recognizable circle
92457Clear circle
113289Smooth circle
1544177Very smooth
2164349Near-perfect
2576489Excellent
3196749Indistinguishable from circle
411241,313Mega build
511602,025Massive

Build use-cases by diameter

Popular Minecraft structures and the diameters that work for them.

Towers and small builds
StructureDiameter
Fountain5 - 9
Wizard tower7 - 11
Lighthouse7 - 13
Watchtower9 - 15
Castle keep11 - 17
Round room9 - 15
Larger builds
StructureDiameter
Dome / planetarium15 - 31
Coliseum / arena31 - 51
Circular wall51 - 101
Sphere (per layer)3 - 51
Crater / lake21 - 81
Stadium (oval)31 × 51

Note: odd diameters (7, 9, 11...) produce a single centre block, useful for symmetric builds with a central feature (a fountain spout, a watchtower stairwell). Even diameters (8, 10, 12...) have a 2×2 centre - fine for floor pads, awkward for towers.

Article — Minecraft Circle Generator

Minecraft circle generator: pixel-perfect rings and discs

A pixel circle in Minecraft is a rasterized circle - the integer-coordinate cells closest to a continuous circle of a given diameter. The standard algorithm was published by Jack Bresenham at IBM in 1965, used in every computer graphics pipeline since, and is now used by millions of players to build round towers and domes out of square blocks.

The generator at the top of this page produces the exact block chart for any diameter from 3 to 64. The article below explains the algorithm, why circles look chunky at small sizes, and how to use the chart for towers, domes, and ovals.

Why circles are hard on a block grid

Minecraft is built on a uniform grid of 1m cubes. Every block is at integer coordinates. A continuous circle has irrational coordinates almost everywhere on its boundary, so the best you can do on a grid is pick the cells closest to that boundary. The result is a polygonal approximation that becomes visually circular only when the radius is large compared to the cell size.

This is the same problem old cathode-ray displays and dot-matrix printers had to solve in the 1960s and 1970s. Pixels were huge by today's standards, and curves had to be drawn one pixel at a time with no floating-point math. The algorithms developed for that hardware are still the basis of every line, circle, and arc you see on a modern screen.

The midpoint algorithm (Bresenham, 1965)

Jack E. Bresenham, working at IBM in the early 1960s, published his line-drawing algorithm in IBM Systems Journal in 1965. The trick was simple in hindsight: starting from a candidate pixel, evaluate a decision function at the midpoint between the two next-possible pixels. The sign of the result tells you which to plot. No multiplications, no divisions, no square roots. Just integer addition.

The line algorithm extended to circles within a few years (Pitteway, 1967; Van Aken, 1984). For a circle of radius r centred at the origin, the decision function is:

Bresenham midpoint circle
f(x, y) = x² + y² − r² (decision function)
f < 0 midpoint inside circle → pick upper pixel
f ≥ 0 midpoint outside circle → pick lower pixel
8-way symmetry compute octant, mirror 7×

The algorithm computes one octant - the 45-degree arc from (r, 0) to (r/√2, r/√2) - and uses the eight symmetries of the circle to plot the rest. That cut the work by 8× on the slow CPUs of 1960s mainframes and is still useful in graphics drivers today.

Did you know

Jack E. Bresenham developed the original line and circle algorithms at IBM in the 1960s. His 1965 algorithm has been cited tens of thousands of times in computer science. The original publication ran to fewer than three pages and described a "plotter," not a screen - the algorithm was intended for the mechanical drum plotters IBM was selling in the early 1960s. It is now baked into hardware in every graphics card on Earth, and into the brain of every Minecraft player who has built a round tower.

How this generator works

The generator above uses a slightly different but equivalent approach: distance from centre. For each cell (x, y) on a square grid of side d, it computes the distance from the cell's centre to the circle's centre. If that distance is at most the radius, the cell is part of the filled disc.

For a hollow ring, the generator filters further: a cell is in the ring only if it is in the disc and at least one of its four orthogonal neighbours is outside the disc. That definition gives the outermost ring exactly, with no gaps and no extra-thick stretches, matching what Bresenham's midpoint algorithm produces for the same radius.

The two formulations give identical results on integer grids and integer radii. The distance method uses one square root per cell and is easier to read; the midpoint method uses only integer arithmetic and was faster on 1960s hardware. On a modern computer the difference is well under a millisecond either way.

Good diameters for builds

Circles at small diameters look chunky. At diameter 3 you get a five-block plus shape; at diameter 5 you get a diamond with rounded corners. The minimum diameter for a "real-looking" circle is 7, and from 11 upward the circle reads as round in-game from any viewing angle.

  • d = 3: a plus / cross. 5 disc blocks.
  • d = 5: a diamond / chunky plus. 13 disc blocks.
  • d = 7: smallest "real" circle. 37 disc blocks.
  • d = 11: smooth, reads as round from any angle. 89 disc blocks.
  • d = 15: very smooth, good for medium towers. 177 disc blocks.
  • d = 21: near-perfect, common for arenas. 349 disc blocks.
  • d = 25: classic "perfect circle" preset. 489 disc blocks.
  • d = 51: massive structure, ~2,000 disc blocks.
Small tower
d = 7-11
20-32 ring blocks
Coliseum
d = 31-51
96-160 ring blocks

Spheres, domes, and stacked circles

A sphere in Minecraft is a stack of circular cross-sections. For a sphere of total diameter D, the equator (middle layer) is a circle of diameter D. Each layer above or below the equator uses a smaller circle, with diameter given by:

r_y = √(R² − (y − R)²), where R = D/2 and y is the layer index from 0 to D − 1.

To build a dome, take the top half of a sphere - layers from the equator up. To build a hemispherical lake, take the bottom half and dig instead of place. The mainstream Minecraft mapping tools (WorldEdit's //sphere and //hsphere, Litematica's sphere shapes) automate this; building by hand is tedious but works for small spheres up to about diameter 21.

Tip

Domes look better with slightly oblate proportions in Minecraft - height closer to 0.85× the equator diameter rather than 1.0×. A perfect hemisphere reads as visually tall in first-person because of the camera FOV. Trim the top 2-3 layers of a 21-diameter dome and the result looks more architecturally correct.

Odd vs even diameter - why it matters

An odd diameter (7, 9, 11,...) produces a single central block. The circle has perfect 4-fold rotational symmetry. Odd is the right choice for towers, fountains, watchtowers, and any structure with a single central feature (a spiral staircase, a beacon, a banner pole).

An even diameter (8, 10, 12,...) has a 2×2 centre and no single block at the middle. The symmetry is still 4-fold but offset by half a block. Even diameters are good for floor pads, helipads, and large open discs where the centre is just part of the floor. They look slightly off when used for towers because the "middle" of the tower is not a block but a corner.

The "two centre blocks" mistake

A common beginner error is to use diameter 8 or 10 for a tower, then place a beacon or banner in the middle. There is no middle. You will end up with the feature offset by half a block in two directions, and the structure looks subtly wrong. Use diameter 7, 9, or 11 instead for any tower with a central feature.

Beyond circles - ovals, arcs, partial rings

The same rasterization principle covers other shapes. An oval (ellipse) uses two radii instead of one and the inequality (x/a)² + (y/b)² ≤ 1. Stadiums, racetracks, and elongated arenas are typical use-cases.

Partial rings (arcs) - useful for amphitheatres, balconies, and crescent moons - take a ring and mask off the parts you do not want. Most Minecraft mapping tools have an //arc or //sphere command that handles this with two angle parameters; building by hand means generating the full ring and removing blocks by sector.

Concentric circles (multiple rings of increasing radius around a common centre) are used for clock faces, mandala patterns, and large mosaic floors. Generate each ring separately and stack them - or use a filled disc with rings of different-coloured blocks for a mosaic effect.

Common build mistakes

Using a tiny diameter for a hollow tower. A diameter-5 hollow ring leaves no usable interior - it is a single-block-thick wall around a 3×3 floor. For walk-in towers, diameter 11 is the minimum for a comfortable interior; 15 is better.

Assuming the algorithm gives 8-fold symmetry on every diameter. The midpoint algorithm is 8-symmetric, but at small diameters the result can look 4-symmetric instead because half the symmetry pixels coincide. The asymmetry only emerges from diameter 9 upward.

Stacking identical circles for a "sphere." A cylinder of stacked identical circles is not a sphere - it is a cylinder. The layer diameters must shrink with distance from the equator using r_y = √(R² − y²). The generator above does one layer; for a full sphere, use a sphere generator or WorldEdit's //sphere command.

Counting blocks by the formula πr². The continuous-circle area formula is a good estimate but not the exact count. Rasterization can produce slightly more or fewer cells depending on whether the radius lands cleanly on a half-integer. The generator's reported count is exact; the formula's value is within a few percent for any practical diameter.

FAQ

There is no perfect circle on a square grid - only the closest approximation. The generator above shows you which blocks to place at each integer coordinate, using the same midpoint algorithm as WorldEdit's //cyl command. Diameters of 15 blocks or more look genuinely round in-game; below 10 blocks the result is chunky.
Diameter 7 blocks is the smallest size where the shape reads as a circle rather than a diamond or cross. Diameter 5 looks like a plus sign with corners. For builds where the circular shape needs to be obvious from inside the structure, 11+ is better.
A sphere is a stack of circles with varying diameters. For a sphere of total diameter D, the middle layer is a circle of diameter D, and each layer above and below uses diameter 2√(R² − y²) where R = D/2 and y is the distance from centre. Generate one circle per layer and stack them. Most online sphere generators automate this; some commands like //sphere in WorldEdit do it instantly.
A diameter-15 ring needs 44 blocks. A filled diameter-15 disc needs 177 blocks. The ring count is close to 2πr = 47; the rasterized version is slightly fewer because the algorithm rounds inward. The disc count is close to πr² = 177 - the rasterized value matches exactly for this diameter.
Ovals use the ellipse equation (x/a)² + (y/b)² ≤ 1, with two different radii. Stadiums, racetracks, and elongated rooms are typical use-cases. The generator above is set up for circles; for ovals, most Minecraft mapping tools like WorldEdit (//cyl with two radii) or Litematica handle elliptical shapes natively.
The classic midpoint circle algorithm, derived from Bresenham's 1965 line-drawing algorithm (IBM Systems Journal). It evaluates a decision function at the midpoint between candidate pixels and uses 8-way symmetry to compute only one octant. Modern implementations use distance-from-centre arithmetic, which gives identical results for integer radii and is easier to read.
You are probably looking at a sphere shell from inside, which compresses the apparent curve. Or the build has off-by-one errors at the centre - common with even diameters that lack a single central block. Try with an odd diameter and stand outside the structure, viewing it from level ground at a distance of roughly 2×diameter.
Jack E. Bresenham, an engineer at IBM, published the algorithm in 1965 in the IBM Systems Journal. The original 1962 paper described line drawing; the circle variant came shortly after. It uses only integer addition and subtraction - critical for the slow CPUs of the 1960s, and still the basis of most graphics-card line and circle drawing today.