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

Algorithm 3

MinDistance algorithm.

	Input: query point q, convex hull point set O
	Output: result minddl
(1)	BEGIN
(2)	Hull←construct(O);
(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)	discur←Discurls.getMin;
(11)	minddl←ddl.Add(o.id, discur);
(12)	Return minddl;
(13)	END