Return how many Hexagonal Tiling grid points there are inside a circle of radius r centred at (0,0) (including points on the edge). Assume that a Hexagonal Tiling grid is a 2D Regular Hexagonal Tessellation with equal edges of size e=1.
For symmetry purposes, assume that (0,0) point is a vacancy; i.e., there are points at (±1,0), (±1/2,±√3/2), etcetera.
Neither string operations nor interpolations are allowed!
Solution Stats
Problem Comments
-
1 Comment
James
on 10 Mar 2017
This problem is looking for the number of vertices on the hexagonal grid inside the circle of radius r. The center of the hexagon is not counted as a point for this problem, and this is true for every hexagon inside the circle.
Recent Solvers21
Suggested Problems
-
First non-zero element in each column
428 Solvers
-
71 Solvers
-
Minimum Distance Point to Segment
35 Solvers
-
Create Volcano (or Atoll) martix. It is an extension of Bullseye matrix problem.
62 Solvers
-
82 Solvers
More from this Author18
Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)