Skip to Content
GPGPU Programming for Games and Science
book

GPGPU Programming for Games and Science

by David H. Eberly
August 2014
Intermediate to advanced
469 pages
16h 30m
English
A K Peters/CRC Press
Content preview from GPGPU Programming for Games and Science
CPU Computing 15
the set of k-tuples of real numbers is IR
k
, n and d are positive integers, m is
a nonnegative integer (if zero, then Y = C), and C is a discrete space that is
referred to as the combinatorial portion of the output.
A typical example is the problem of computing the convex hull of a finite
set of points in two dimensions. In the definition, d = 2, which is the dimension
of the space containing the points, n is the number of points in the set, and
m = 0. The input points are indexed with integers 1 through n,andC is the
set of all ordered subsets of {1,...,n}. The output of the convex hull algorithm
is an element of C,say,{i
1
,...,i
q
}, which represents the ordered vertices of
the convex polygon that is the convex hull boundary; mathematically ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Graphics Gems V (IBM Version)

Graphics Gems V (IBM Version)

Alan W. Paeth
GPU Pro 6

GPU Pro 6

Wolfgang Engel

Publisher Resources

ISBN: 9781466595354