<--- 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

A STAR FRONTIERS® GAME FEATURE  LAYOVER AT LOSSEND by Russ Horn  Polyhedron Magazine, #18, pg. 25

A STAR FRONTIERS® GAME FEATURE LAYOVER AT LOSSEND by Russ Horn Polyhedron Magazine, #18, pg. 25

DocID: 1vjMG - View Document

International Euler Symposium University of Basel Euler, Polyhedron, and Smooth 4-Manifolds  Ronald J. Stern

International Euler Symposium University of Basel Euler, Polyhedron, and Smooth 4-Manifolds Ronald J. Stern

DocID: 1uoqD - View Document

RPGA® Network POLYHEDRON® Newszine Index For Issues 1 through 118 Including the Introductory Issue [A] Created by Todd

RPGA® Network POLYHEDRON® Newszine Index For Issues 1 through 118 Including the Introductory Issue [A] Created by Todd "Vand" Vanderbeek For use by the Members of the RPGA Network

DocID: 1uiZG - View Document

Flip-Flop: Convex Hull Construction via Star-Shaped Polyhedron in 3D

Flip-Flop: Convex Hull Construction via Star-Shaped Polyhedron in 3D

DocID: 1tNUv - View Document

Flip- Flop : Convex Hull Construction via Star-Shaped Polyhedron in 3D Mingcen Gao Thanh-Tung Cao  Tiow-Seng Tan

Flip- Flop : Convex Hull Construction via Star-Shaped Polyhedron in 3D Mingcen Gao Thanh-Tung Cao Tiow-Seng Tan

DocID: 1tLDX - View Document