Let's define the family of consecutive subsets of $\mathbb{N}$: $$S_n =\{x \in \mathbb{N}\,:\,|x-n^2|\le n\}$$ With the previous definition we have that $$U_n=\bigcup_{k=1}^n S_k=\{x \in \mathbb{N}\,:\,0\le x \le n^2+n\}$$ and $$\pi(U_n)\sim\frac{n^2}{2\log n}$$ while $$\pi(S_n)\sim\pi(U_n)-\pi(U_{n-1})\sim\frac{n}{\log n}$$ Therefore, the density of primes in $S_n$ is given by: $$\rho_n=\frac{\pi(S_n)}{2n}\sim \frac{1}{2\log n}$$ Now let's extend all the previous arguments to the complex plane: $$D_n =\{z \in \mathbb{C}\,:\,|z-n^2|\le n\}$$ $$V_n=\bigcup_{k=1}^n D_k$$ If we indicate with $\pi_G(X)$ the number of gaussian primes inside the subset $X$ of $\mathbb{C}$, numerical investigation suggests that $$\pi_G(V_n)\sim\frac{n^3}{3\log n}\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;(1)$$ while $$\pi_G(D_n)\sim\pi_G(V_n)-\pi_G(V_{n-1})\sim\frac{n^2}{\log n}\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;(2)$$ So the density of gaussian primes in $D_n$ is given by: $$\rho_n^G\sim\frac{\pi_G(D_n)}{\pi n^2}\sim \frac{1}{\pi \log n}\;\;\;\;\;\;\;\;\;\;\;\;\;\;\;(3)$$
I would appreciate any suggestion about theoretical validation of asymptotic behaviors (1), (2), (3).