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
-
2825 Solvers
-
How to find the position of an element in a vector without using the find function
2822 Solvers
-
Sum all integers from 1 to 2^n
18106 Solvers
-
Simple equation: Annual salary
4271 Solvers
-
Is this triangle right-angled?
6843 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.