Planar convex hull algorithms in theory and practice

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)


Sequential and parallel planar convex hull algorithms, their applications and some of the problems encountered on implementations are described. Details of Pascal implementations are given for three of the sequential algorithms: Graham's, Floyd-Eddy and the Approximation method. The programs are compared experimentally.
Original languageEnglish
Pages (from-to)177-193
Number of pages17
JournalComputer Graphics Forum
Issue number3
Publication statusPublished - Sep 1988

Cite this