The following pages link to Cutting dense point sets in half (Q1355189):
Displaying 17 items.
- Approximate center points in dense point sets (Q287016) (← links)
- Halving point sets (Q1126842) (← links)
- Improved bounds for intersecting triangles and halving planes (Q1208053) (← links)
- On the number of corner cuts (Q1865258) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Separation by convex pseudo-circles (Q2022622) (← links)
- The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem (Q2033908) (← links)
- Bivariate B-splines from convex configurations (Q2037190) (← links)
- Dense point sets with many halving lines (Q2207605) (← links)
- Polynomial-reproducing spline spaces from fine zonotopal tilings (Q2237924) (← links)
- Flip distance to some plane configurations (Q2331207) (← links)
- Few cuts meet many point sets (Q2696278) (← links)
- CENTROID TRIANGULATIONS FROM k-SETS (Q4650084) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Flip Distance to some Plane Configurations. (Q5116475) (← links)
- Cutting a bunch of grapes by a plane (Q5946642) (← links)
- An effective solution to convex 1-body \(N\)-representability (Q6158479) (← links)