Simplify convex hull algorithm by returning lists of points rather than lines.
Simplify convex hull algorithm by returning lists of points rather than lines.

We can avoid some data redundancy that way at no performance cost.

ClaireRutkoske/paper.js,EskenderDev/paper.js,legendvijay/paper.js,legendvijay/paper.js,byte-foundry/paper.js,rgordeev/paper.js,ClaireRutkoske/paper.js,Olegas/paper.js,mcanthony/paper.js,rgordeev/paper.js,proofme/paper.js,luisbrito/paper.js,li0t/paper.js,fredoche/paper.js,chad-autry/paper.js,nancymark/paper.js,nancymark/paper.js,lehni/paper.js,Olegas/paper.js,luisbrito/paper.js,byte-foundry/paper.js,JunaidPaul/paper.js,li0t/paper.js,ClaireRutkoske/paper.js,fredoche/paper.js,iconexperience/paper.js,legendvijay/paper.js,proofme/paper.js,lehni/paper.js,mcanthony/paper.js,EskenderDev/paper.js,proofme/paper.js,baiyanghese/paper.js,superjudge/paper.js,superjudge/paper.js,Olegas/paper.js,JunaidPaul/paper.js,JunaidPaul/paper.js,EskenderDev/paper.js,fredoche/paper.js,mcanthony/paper.js,luisbrito/paper.js,iconexperience/paper.js,byte-foundry/paper.js,lehni/paper.js,li0t/paper.js,baiyanghese/paper.js,rgordeev/paper.js,iconexperience/paper.js,baiyanghese/paper.js,nancymark/paper.js,superjudge/paper.js