ThispaperpresentsanewandsimpleschemetodescribetheconvexhullinR^d,whichonlyusesthreekindsofthefacesoftheconvexhull.i.e.,thed-1-faces,d-2-facesand0-faces.Thus,wedevelopandefficientnewalgorithmforconstructingtheconvexhullofafinitesetofpointsincrementally.Thisalgorithmemploysmuchlessstorageandtimethanthatofthepreviously-existingapproaches.Theanalysisoftherunniingtimeaswellasthestorageforthenewalgorithmisalsotheoreticallymade.Thealgorithmisoptimalintheworstcaseforevend.