Pages that link to "Item:Q1091824"
From MaRDI portal
The following pages link to Computing a ham-sandwich cut in two dimensions (Q1091824):
Displaying 18 items.
- Geodesic ham-sandwich cuts (Q878384) (← links)
- Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) (Q906384) (← links)
- A geometric consistency theorem for a symbolic perturbation scheme (Q918201) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Bisections and ham-sandwich cuts of convex polygons and polyhedra (Q1178190) (← links)
- A linear algorithm for bisecting a polygon (Q1186591) (← links)
- The catline for deep regression (Q1268021) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- Green eggs and ham (Q1596764) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Bisecting envelopes of convex polygons (Q2122767) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- Symbolic treatment of geometric degeneracies (Q2638833) (← links)
- A Complete Implementation for Computing General Dimensional Convex Hulls (Q4513209) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- Geodesic ham-sandwich cuts (Q5361648) (← links)
- The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich (Q5863324) (← links)
- Optimal line bipartitions of point sets (Q6487424) (← links)
