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
-
Sort a list of complex numbers based on far they are from the origin.
5810 Solvers
-
Which values occur exactly three times?
5247 Solvers
-
Back to basics 23 - Triangular matrix
1135 Solvers
-
316 Solvers
-
Make an awesome ramp for a tiny motorcycle stuntman
764 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.