Concepedia

Counting and cutting cycles of lines and rods in space

Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink

Computational Geometry · 1992 · 70 citations · 11 references

DOI

Concepts

References

11

On visible surface generation by a priori tree structures

Henry Fuchs, Zvi M. Kedem, Bruce Naylor · 1980 · 698 citations · Full text

, , +17

Extremal problems in discrete geometry

Endre Szemerédi, W. T. Trotter · COMBINATORICA · 1983 · 556 citations

, , +14

An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle, Herbert Edelsbrunner · Journal of the ACM · 1992 · 327 citations · Full text

, , +12

Combinatorial complexity bounds for arrangements of curves and spheres

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas Guibas et al. · Discrete & Computational Geometry · 1990 · 324 citations · Full text

, , +12

On visible surface generation by a priori tree structures

Henry Fuchs, Zvi M. Kedem, Bruce Naylor · ACM SIGGRAPH Computer Graphics · 1980 · 320 citations

, , +17