On the general motion-planning problem with two degrees of freedom

An algorithm for planning collision-free paths among polyhedral obstacles

Tomás Lozano‐Pérez, M. A. Wesley · Communications of the ACM · 1979 · 2.3K citations

Computing, Computer Science, Algorithms +9

Algorithms for Reporting and Counting Geometric Intersections

Bentley, Ottmann · IEEE Transactions on Computers · 1979 · 999 citations

Computing, Computer Science, Mathematics +13

Applications of random sampling in computational geometry, II

Kenneth L. Clarkson · 1988 · 943 citations · Full text

Computing, Computer Science, Mathematics +10

On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds

Jacob T. Schwartz, Micha Sharir · Advances in Applied Mathematics · 1983 · 807 citations

Natural Sciences, Computer Science, Mathematics +12

Making data structures persistent

James R. Driscoll, Neil Sarnak, Daniel D. Sleator et al. · 1986 · 704 citations

Computing, Computer Science, Algorithms +8