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
-
Find the longest sequence of 1's in a binary sequence.
6850 Solvers
-
240 Solvers
-
Construct an index vector from two input vectors in vectorized fashion
462 Solvers
-
Getting the indices from a matrix
735 Solvers
-
Reverse the elements of an array
1146 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.