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
-
1799 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
2075 Solvers
-
How many trades represent all the profit?
619 Solvers
-
Right Triangle Side Lengths (Inspired by Project Euler Problem 39)
2150 Solvers
-
The Answer to Life, the Universe, and Everything
588 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.