Back to Results
First PageMeta Content
Polyhedron / Convex polytope / Planar graph / Computational geometry / Convex and concave polygons / Monotone polygon / Bentley–Ottmann algorithm / Geometry / Polygons / Simple polygon


GEOMETRIC INTERSECTION PROBLEMS t Michael Ian Shamos Departments of Computer Science and Mathematics
Add to Reading List

Document Date: 2012-10-31 17:55:32


Open Document

File Size: 253,70 KB

Share Result on Facebook

Company

IBM / Michael Ian Shamos / /

Event

Force Majeure / /

Facility

Mathematics Carnegie-Mellon University / Yale University / /

IndustryTerm

geometric algorithms / industrial applications / binary search / quadratic algorithms / ~e algorithm / linear algorithm / expensive algorithm / convex polygon intersection algorithm / algorithms / problem-dependent systems / ear algorithm / /

Movie

UP and DOWN / /

Organization

Dan Hoey Department of Computer Science Yale University New Haven / office of Naval Research / Computer Science and Mathematics Carnegie-Mellon University Pittsburgh / Yale University / /

Person

Dan Hoey / Stan Eisenstat / Julie / /

Position

conductor / first author / /

ProvinceOrState

Pennsylvania / Connecticut / /

Technology

RAM / linear algorithm / convex polygon intersection algorithm / ~e algorithm / even quadratic algorithms / ear algorithm / succeSSIU~~Y ~4-nce rinds Algorithm / geometric algorithms / Computer Algorithms / integrated circuit / /

SocialTag