• All-farthest-segments for a planar point set (authors: Samidh Chatterjee and Eugene Greene)

  • Minimum-area convex polygonal stabber for vertical segments (author: Eugene Greene)

  • An RNG-based heuristic for curve reconstruction (author: Augustus Das)

  • Segment intersection by sweepline (author: Ben Lafreniere)

  • Closest pair by sweepline (author: Augustus Das)

  • Smallest enclosing disk of a planar point set (author: Ben Lafreniere)

  • Fortune's algorithm for Voronoi diagram (author: Ben Lafreniere)

  • Finding an ordinary line (author: Eugene Greene)

  • Minimum area convex polygon stabber of a set of orthogonal line segments (authors: Xin Wu, Xijie Zeng and Bryan St.Amour)

  • Finding an empty rectangle of arbitrary orientation (authors: Hongtao Zhang and Dulon Roychowdhury)

  • Monotone matrix method for finding a maximum segment of a sequence (author: Eugene Greene)

  • Approximate ellipse of a set of points in the streaming model (author: Eugene Greene)

  • Convex Hull of a set of points (author: Adam Hartfiel)

  • Approximate rectangles in the streaming model (author: Tom Switzer)

  • Maximum Density Segment Visualization (author: Chris Drouillard)