Similar Items: Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
- Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
- Counting All Lattice Rectangles in the Square Grid in Near-Linear Time
- 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
- Apple Peel Unfolding of Archimedean and Catalan Solids
- On the volume of the elliptope and related metric polytopes