A Comparison of Tabular PDF Inversion Methods

Simple item page
dc.contributor.authorCline, D.en_US
dc.contributor.authorRazdan, A.en_US
dc.contributor.authorWonka, P.en_US
dc.date.accessioned2015-02-23T09:07:47Z
dc.date.available2015-02-23T09:07:47Z
dc.date.issued2009en_US
dc.description.abstractThe most common form of tabular inversion used in computer graphics is to compute the cumulative distribution table of a probability distribution (PDF) and then search within it to transform points, using an O(logA n) binary search. Besides the standard inversion method, however, several other discrete inversion algorithms exist that can perform the same transformation inO(1) time per point. In this paper, we examine the performance of three of these alternate methods, two of which are new.en_US
dc.description.number1en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2008.01197.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages154-160en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2008.01197.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleA Comparison of Tabular PDF Inversion Methodsen_US
Files
Collections
28-Issue 1