Planar convex hull algorithms in theory and practice

A. M. Day

doi:10.1111/j.1467-8659.1988.tb00608.x

Planar convex hull algorithms in theory and practice

A. M. Day

Research output: Contribution to journal › Article › peer-review

15 Citations (Scopus)

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.

Original language	English
Pages (from-to)	177-193
Number of pages	17
Journal	Computer Graphics Forum
Volume	7
Issue number	3
DOIs	https://doi.org/10.1111/j.1467-8659.1988.tb00608.x
Publication status	Published - Sep 1988

Access to Document

10.1111/j.1467-8659.1988.tb00608.x

Cite this

@article{d10f11019ab14b23bd3a80858bb797bb,

title = "Planar convex hull algorithms in theory and practice",

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.",

author = "Day, {A. M.}",

year = "1988",

month = sep,

doi = "10.1111/j.1467-8659.1988.tb00608.x",

language = "English",

volume = "7",

pages = "177--193",

journal = "Computer Graphics Forum",

issn = "0167-7055",

publisher = "Wiley",

number = "3",

}

TY - JOUR

T1 - Planar convex hull algorithms in theory and practice

AU - Day, A. M.

PY - 1988/9

Y1 - 1988/9

N2 - 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.

AB - 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.

U2 - 10.1111/j.1467-8659.1988.tb00608.x

DO - 10.1111/j.1467-8659.1988.tb00608.x

M3 - Article

VL - 7

SP - 177

EP - 193

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -