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
-
Is my wife right? Now with even more wrong husband
1343 Solvers
-
Find the "ordinary" or Euclidean distance between A and Z
177 Solvers
-
Back to basics 12 - Input Arguments
622 Solvers
-
Remove the two elements next to NaN value
703 Solvers
-
Edges of a n-dimensional Hypercube
88 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.