Return how many Triangular Tiling grid points there are inside a circle of radius r centred at (0,0) (including points on the edge).
Assume that a Triangular Tiling grid is a 2D Hexagonal Bravais lattice with | a1 | = | a2 | = 1 and φ = 120°.
Neither string operations nor interpolations are allowed!
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers31
Suggested Problems
-
Find the peak 3n+1 sequence value
2565 Solvers
-
Back to basics 4 - Search Path
380 Solvers
-
Sum of first n terms of a harmonic progression
497 Solvers
-
Calculate the area of a triangle between three points
3413 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
512 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 set has so many problems about dots that I'm starting to see spots in my vision.