Algorithm 1.

Farthest point sampling with Breadth-first Search (FBS)

Input: Hyperbolic parameter space.
Output: A collect of different amount overlapped patches on topological structure.
1:	Start with X′= {px1}, Xr denotes all discrete vertices on the hyperbolic space.
2:	for t=1 to T do
3:	for r do determine sampling radius
4:	Find all connected components pxt,i of pxt by using one step BFS.
5:	Find set Pxt similar with Eq. 1 by using one step BFS.
6:	r = maxpx′ ∈ Xr dXr(px′, pxt)
7:	if r ≤ 10e−2 then STOP
8:	end if
9:	Find the farthest point from X′
10:	pxt+1 = arg maxpx′ ∈ Xr dr(px′, X′)
11:	Add pxt+1 to X′
12:	end for
13:	end for