The following pages link to Multidimensional Sorting (Q3038629):
Displaying 50 items.
- On the number of crossing-free partitions (Q359753) (← links)
- Reprint of: Extreme point and halving edge search in abstract order types (Q390177) (← links)
- Geodesic order types (Q486983) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- Cutting convex curves (Q739047) (← links)
- Necessary and sufficient conditions for hyperplane transversals (Q756135) (← links)
- Semispaces of configurations, cell complexes of arrangements (Q801058) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Two disjoint 5-holes in point sets (Q827302) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- Realization of abstract convex geometries by point configurations (Q1041213) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (Q1086843) (← links)
- The complexity of point configurations (Q1175788) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- On the distribution of order types (Q1188283) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Spanned \(k\)-supporting hyperplanes of finite sets in \(\mathbb{R}^ d\) (Q1317458) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Reconfiguring closed polygonal chains in Euclidean \(d\)-space (Q1346132) (← links)
- Towards compatible triangulations. (Q1401254) (← links)
- The topology of the space of transversals through the space of configurations (Q1601649) (← links)
- Drawing the Horton set in an integer grid of minimum size (Q1616238) (← links)
- Order on order types (Q1650795) (← links)
- Ham-sandwich cuts for abstract order types (Q1702128) (← links)
- Counting polytopes via the Radon complex (Q1826858) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- On the number of order types in integer grids of small size (Q1984592) (← links)
- Many order types on integer grids of polynomial size (Q2096371) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Tukey depth histograms (Q2169954) (← links)
- New lower bounds for Tverberg partitions with tolerance in the plane (Q2192113) (← links)
- Minimal representations of order types by geometric graphs (Q2206835) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- On order types of systems of segments in the plane (Q2270173) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Approximating the rectilinear crossing number (Q2331210) (← links)
- Extreme point and halving edge search in abstract order types (Q2391543) (← links)
- Many empty triangles have a common edge (Q2391838) (← links)
- Drawing the almost convex set in an integer grid of minimum size (Q2401331) (← links)
- Carathéodory's theorem in depth (Q2408186) (← links)
- Erdős-Szekeres ``happy end''-type theorems for separoïds (Q2427552) (← links)
- Representing finite convex geometries by relatively convex sets (Q2434746) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- Reconstructing Point Set Order Typesfrom Radial Orderings (Q2942609) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
