Computing minimum length paths of a given homotopy class

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

Natural Sciences, Computer Science, Mathematics +6

An efficient algorith for determining the convex hull of a finite planar set

Ronald Graham · Information Processing Letters · 1972 · 1.7K citations

Computing, Computer Science, Algorithms +12

Primitives for the manipulation of general subdivisions and the computation of Voronoi

Leonidas Guibas, Jorge Stolfi · ACM Transactions on Graphics · 1985 · 1.3K citations · Full text

Computing, Computer Science, Mathematics +14

Triangulating a simple polygon in linear time

Bernard Chazelle · Discrete & Computational Geometry · 1991 · 636 citations · Full text

Computing, Computer Science, Algorithms +15

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas Guibas, John Hershberger, Daniel Leven et al. · Algorithmica · 1987 · 508 citations

Computing, Computer Science, Mathematics +16