摘要
ThispaperpresentsanewandsimpleschemetodescribetheconvexhullinR^d,whichonlyusesthreekindsofthefacesoftheconvexhull.i.e.,thed-1-faces,d-2-facesand0-faces.Thus,wedevelopandefficientnewalgorithmforconstructingtheconvexhullofafinitesetofpointsincrementally.Thisalgorithmemploysmuchlessstorageandtimethanthatofthepreviously-existingapproaches.Theanalysisoftherunniingtimeaswellasthestorageforthenewalgorithmisalsotheoreticallymade.Thealgorithmisoptimalintheworstcaseforevend.
出版日期
1992年01月11日（中国期刊网平台首次上网日期，不代表论文的发表时间）
