Planar convex hull algorithms in theory and practice

Day, A. M. (1988) Planar convex hull algorithms in theory and practice. Computer Graphics Forum, 7 (3). pp. 177-193. ISSN 1467-8659

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
UEA Research Groups:	Faculty of Science > Research Groups > Interactive Graphics and Audio Faculty of Science > Research Groups > Computer Graphics (former - to 2018)
Depositing User:	Vishal Gautam
Date Deposited:	19 Jan 2012 14:24
Last Modified:	04 Mar 2024 16:49
URI:	https://ueaeprints.uea.ac.uk/id/eprint/23479
DOI:	10.1111/j.1467-8659.1988.tb00608.x

Actions (login required)

View Item