On Arrangements of Jordan Arcs with Three Intersections per Pair. H. Edelsbrunner; Raimund Seidel; Micha Sharir; Richard Pollack; Janos Pach; Leonidas Guibas; John Hershberger; Jack Snoeyink — 1989 Discrete & computational geometry
How long can a graph be kept planar? Anuradha, V.; Jain, Chinmay; Snoeyink, Jack; Szabó, Tibor — 2008 The Electronic Journal of Combinatorics [electronic only]
Implicitly Representing Arrangements of Lines or Segments. H. Edelsbrunner; Raimund Seidel; Micha Sharir; Leonidas Guibas; John Hershberger; Jack, Welzl, Emo Snoeyink — 1989 Discrete & computational geometry