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

Algorithm 1

OneJudVisible algorithm.

	Input: query point q, obstacle point set O, query object set Obj
	Output: True/False
(1)	BEGIN
(2)	lis_qObj←Obj.Add(q);
(3)	qObjHu←construct(lis_qObj);
(4)	qToridge←getq_ridge(qObjHull);
(5)	ObsHull←construct(O);
(6)	fac←getFac(ObsHull);
(7)	for each line in q_ridge do
(8)	for each f in fac do
(9)	num←deal (line, f);
(10)	lis_View.Add(num);
(11)	end for
(12)	end for
(13)	if (lis_View.Cotains(0)) then
(14)	Return True;
(15)	else
(16)	Return False;
(17)	end if
(18)	END