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
-
Least common multiple of many numbers
256 Solvers
-
Determine if a Given Number is a Triangle Number
400 Solvers
-
Change the sign of even index entries of the reversed vector
660 Solvers
-
Implement a bubble sort technique and output the number of swaps required
398 Solvers
-
Rounding off numbers to n decimals
5755 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.