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
-
1347 Solvers
-
163 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
519 Solvers
-
Circular Primes (based on Project Euler, problem 35)
655 Solvers
-
Chebyshev polynomials of the 1st Kind
81 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!