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
-
4183 Solvers
-
23696 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2538 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
583 Solvers
-
Create an index-powered vector
939 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.