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
Solution Comments
Show comments
Loading...
Problem Recent Solvers29
Suggested Problems
-
1375 Solvers
-
Determine if a Given Number is a Triangle Number
398 Solvers
-
Find the sum of the elements in the "second" diagonal
1204 Solvers
-
Return the first and last characters of a character array
11859 Solvers
-
5073 Solvers
More from this Author18
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
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.