The Implementation of a 2D Convex Hull Algorithm Using Perturbation

Simple item page
dc.contributor.authorDay, A.M.en_US
dc.date.accessioned2014-10-21T06:18:37Z
dc.date.available2014-10-21T06:18:37Z
dc.date.issued1990en_US
dc.description.abstractThis paper discusses the problem of geometric degeneracies and outlines possible solutions when converting geometric algorithms into practice. It concentrates on the application of one of the suggested solutions, a perturbation technique, to a 2D convex hull program. An outline of the relevant theory and its conversion into practice is given. Experimental results are presented and discussed.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume9en_US
dc.identifier.doi10.1111/j.1467-8659.1990.tb00421.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages309-316en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.1990.tb00421.xen_US
dc.publisherBlackwell Publishing Ltd and the Eurographics Associationen_US
dc.titleThe Implementation of a 2D Convex Hull Algorithm Using Perturbationen_US
Files
Collections
Issue 4