Time- and storage-efficient implementation of an optimal planar convex hull algorithm

BK Bhattacharya; GT Toussaint

doi:10.1016/0262-8856(83)90065-3

Time- and storage-efficient implementation of an optimal planar convex hull algorithm

BK Bhattacharya, GT Toussaint

Computer Science

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

Abstract

An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.

Original language	English (US)
Pages (from-to)	140-144
Number of pages	5
Journal	Image and Vision Computing
Volume	1
Issue number	3
DOIs	https://doi.org/10.1016/0262-8856(83)90065-3
State	Published - Aug 1983

Keywords

algorithm
computational geometry
convex hull
expected complexity

ASJC Scopus subject areas

Signal Processing
Computer Vision and Pattern Recognition

Access to Document

10.1016/0262-8856(83)90065-3

Cite this

@article{65143cbb8e694515b27087d96410a50e,

title = "Time- and storage-efficient implementation of an optimal planar convex hull algorithm",

abstract = "An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.",

keywords = "algorithm, computational geometry, convex hull, expected complexity",

author = "BK Bhattacharya and GT Toussaint",

year = "1983",

month = aug,

doi = "10.1016/0262-8856(83)90065-3",

language = "English (US)",

volume = "1",

pages = "140--144",

journal = "Image and Vision Computing",

issn = "0262-8856",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - Time- and storage-efficient implementation of an optimal planar convex hull algorithm

AU - Bhattacharya, BK

AU - Toussaint, GT

PY - 1983/8

Y1 - 1983/8

N2 - An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.

AB - An implementation of an algorithm for computing the convex hull of a finite planar set of points is presented. The program is compared with an algorithm for the same purpose coded previously. Experimental results indicate that our program is superior to the other in terms of both running time and storage requirements.

KW - algorithm

KW - computational geometry

KW - convex hull

KW - expected complexity

UR - http://www.scopus.com/inward/record.url?scp=0020796134&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020796134&partnerID=8YFLogxK

U2 - 10.1016/0262-8856(83)90065-3

DO - 10.1016/0262-8856(83)90065-3

M3 - Article

AN - SCOPUS:0020796134

SN - 0262-8856

VL - 1

SP - 140

EP - 144

JO - Image and Vision Computing

JF - Image and Vision Computing

IS - 3

ER -

Time- and storage-efficient implementation of an optimal planar convex hull algorithm

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this