Similar Items: Computing Planar Convex Hulls with a Promise
- Planar morphometry via functional shape data analysis and quasi-conformal mappings
- Exact Subquadratic Algorithm for Many-to-Many Matching on Planar Point Sets with Integer Coordinates
- Peeling Rotten Potatoes for a Faster Approximation of Convex Cover
- Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
- A greedy maximal sweepline algorithm for a Jordan curve
- A proof of Jordan curve theorem based on the sweepline algorithm for trapezoidal decomposition of a polygon