Pages that link to "Item:Q1209837"
From MaRDI portal
The following pages link to Cutting hyperplanes for divide-and-conquer (Q1209837):
Displaying 33 items.
- Convex hulls under uncertainty (Q2408916) (← links)
- Maximum overlap and minimum convex hull of two convex polyhedra under translations (Q2483561) (← links)
- A semi-algebraic version of Zarankiewicz's problem (Q2628329) (← links)
- A new asymmetric inclusion region for minimum weight triangulation (Q2655340) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing (Q2956040) (← links)
- Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures (Q3000523) (← links)
- Multiple Cuts in Separating Plane Algorithms (Q3133233) (← links)
- (Q4281517) (← links)
- (Q4304388) (← links)
- Simplex Range Searching and Its Variants: A Review (Q4604367) (← links)
- Approximating the k-Level in Three-Dimensional Plane Arrangements (Q4604386) (← links)
- COMPUTING CLOSEST POINTS FOR SEGMENTS (Q4818603) (← links)
- Fast Combinatorial Algorithm for Tightly Separating Hyperplanes (Q4912422) (← links)
- A survey of mass partitions (Q5067418) (← links)
- Hypergraph Cuts with General Splitting Functions (Q5094916) (← links)
- On range searching with semialgebraic sets (Q5096815) (← links)
- Subquadratic Encodings for Point Configurations (Q5115787) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES (Q5299999) (← links)
- REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS (Q5300004) (← links)
- Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702) (← links)
- FINDING SIMPLICES CONTAINING THE ORIGIN IN TWO AND THREE DIMENSIONS (Q5388706) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Range closest-pair search in higher dimensions (Q5896868) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)
- On the number of regular vertices of the union of Jordan regions (Q5932807) (← links)
- An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)
- Minimum-width double-slabs and widest empty slabs in high dimensions (Q6547941) (← links)
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data (Q6586656) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
- Evasive sets, covering by subspaces, and point-hyperplane incidences (Q6624199) (← links)