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 shifted symmetry purposes, assume that (0,0) is a grid point.
Neither string operations nor interpolations are allowed!
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers25
Suggested Problems
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
Getting the indices from a vector
11842 Solvers
-
Reverse the elements of an array
1114 Solvers
-
918 Solvers
-
Matrix multiplication across rows
397 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!
