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
-
Smallest distance between a point and a rectangle
278 Solvers
-
410 Solvers
-
Create a square matrix of multiples
498 Solvers
-
Minimum Distance Point to Segment
62 Solvers
-
Beads on a Necklace (Convex Hulls)
57 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!
