UN Extraordinary patch s can be partitioned into an infinite sequence of regular triangular sub- patchs: S:k≥1，m=1,2,3} corresponding to tiles %,k1,m=1,2,3 F is partitioned into sub-triangles,=1,2.3 accordingly. (0,0) (0,1) 2 For each subpatch S, 25 小S,w）-a(,w)sD(w)M≤B(mM D(v,w):distance bound function ·Bm=ma%D,w） (1,0Extraordinary patch can be partitioned into an infinite sequence of regular triangular sub￾patchs: corresponding to tiles is partitioned into sub-triangles accordingly. For each subpatch , „ : distance bound function „ { : 1, 1,2,3 } k m S k m ≥ = S k S m (, ) k D vw m (, ) ( ) max ( , ) k k m m v w β n D vw ∈Ω = l (, ) (, ) (, ) () k k k k m m m m S F vw vw D vwM nM −≤ ≤ β l , 1, 1,2,3 k F F m ≥ = k m , 1, 1,2,3 k m Ω ≥ = k m