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
-
Replace NaNs with the number that appears to its left in the row.
3073 Solvers
-
182 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
591 Solvers
-
Convert Two Character String into a Binary Vector
241 Solvers
-
Approximation of Pi (vector inputs)
285 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!
