<--- Back to Details
First PageDocument Content
Parallel computing / Computer science / Computational complexity theory / Computational geometry / Randomized algorithm / Sweep line algorithm / Polyhedron / Mathematics / Spanning tree / Hidden line removal / Arrangement of lines
Parallel computing
Computer science
Computational complexity theory
Computational geometry
Randomized algorithm
Sweep line algorithm
Polyhedron
Mathematics
Spanning tree
Hidden line removal
Arrangement of lines

UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll

Add to Reading List

Source URL: mapcontext.com

Download Document from Source Website

File Size: 600,97 KB

Share Document on Facebook

Similar Documents

PDF Document

DocID: 1xSAp - View Document

PDF Document

DocID: 1xP7V - View Document

PDF Document

DocID: 1x8Vj - View Document

PDF Document

DocID: 1x2r1 - View Document

PDF Document

DocID: 1wHMX - View Document