%0 Journal Article
%T ON THE LOWER BOUND FOR CONVEX HULL PROBLEM<br>凸壳问题的计算时间下界
%A Wang Xiaodong
%A <br>王晓东
%J 软件学报
%D 1994
%I 
%X As pointed out by A. Aggarwal the lower bound proof for convex hull problem of Steele and Yao is only positive when the points are not necessarily in general position. It is nuclear whether their proof can be modified to handle the case where there is no any restriction on the solution set of the problem. In the fixed-order algebraic-descision -tree model this paper solves the problem completely.
%K Convex hull
%K lower bound<br>凸壳，计算时间下界
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=F53BD2368839BAB86344EA3FB87DA309&yid=3EBE383EEA0A6494&vid=94C357A881DFC066&iid=59906B3B2830C2C5&sid=16D8618C6164A3ED&eid=BE33CC7147FEFCA4&journal_id=1000-9825&journal_name=软件学报&referenced_num=2&reference_num=7