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 Solvers32
Suggested Problems
-
Reverse the Words (not letters) of a String
471 Solvers
-
Who knows the last digit of pi?
691 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
264 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1263 Solvers
-
Find the optimal shape to bring the maximum product by a given perimeter
45 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.