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
-
Omit columns averages from a matrix
620 Solvers
-
Solve the set of simultaneous linear equations
512 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
266 Solvers
-
276 Solvers
-
Return fibonacci sequence do not use loop and condition
873 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.