Similar Items: Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
- Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
- Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
- A greedy maximal sweepline algorithm for a Jordan curve
- Second gonality of smooth aCM curves on quartic surfaces in $mathbb{P}^3$
- Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
- A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon