An efficient location reporting and indexing framework for urban road moving objects

Visibility Detection of 3D Objects and Visual K-Nearest Neighbor Query Based on Convex Hull Model

“…Yu et al [19] proposed a DSI index structure that could process k-NN queries in a distributed manner. Han et al [20] proposed a new GRI framework and H-GTPR tree index structure for the problem that moving objects on the urban road often changed, and it was not easy to track and query. e studies above were more suitable for centralized data processing.…”

“…(3) fac←getFac(Hull); (4) for each f in fac do (5) if(q.view(f ) � � true) then (6) discurl←dl(line, q, f ); (7) Discurls.Add(discurl); (8) end if (9) end for (10) Fac←GetFac(Concave); (7) for each ridge in Ridge do (8) for each fac in Fac do (9) if (ridge.id ! � fac.id) then (10) num←IntSegTri (ridge, fac); (11) end if (12) end for (13) end for (14) if num.Contains(1) then (15) Lis_Obs.Add(ObsSet [ridge.id]); (16) end if (17) end for (18) mulObs←MulJud (q, Obs, Lis_Obs); (19) TorF←OneJudVisible(q, Obj, mulObs); (20) 2) ddl←Sort(O, q); (3) for each Obj in ddl do ( 4) qToObj←Add(q); (5) for each Obs in ddl do (6) if Obs.address < Obj.address then (7) TorF←GJK(qToObj, Obs); (8) end if (9) if (TorF � � true) then (10) ObsSet.Add(Obs); (11) end if (12) if ObsSet.Count � � 0 then (13) Visiual.Add(qToObj); (14) else (15) if(Occlusion(q, Obj, ObsSet)) then ( 16)…”