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 Solvers33
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15805 Solvers
-
2249 Solvers
-
Removing rows from a matrix is easy - but what about inserting rows?
274 Solvers
-
Create a vector whose elements depend on the previous element
796 Solvers
-
5983 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.