Multidimensional Sorting

DOI10.1137/0212032zbMath0525.68038OpenAlexW4244525603WikidataQ56815620 ScholiaQ56815620MaRDI QIDQ3038629

Publication date: 1983

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0212032

zbMATH Keywords

pattern recognition convex hull cluster analysis orientation computational geometry efficient algorithms stereochemistry geometric sorting multidimensional configuration planar configuration of points

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Configuration theorems in linear incidence geometry (51A20)

Related Items

Drawing the Horton set in an integer grid of minimum size, Two disjoint 5-holes in point sets, Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\), There are asymptotically far fewer polytopes than we thought, Point set pattern matching in \(d\)-dimensions, Better lower bounds on detecting affine and spherical degeneracies, Reconfiguring closed polygonal chains in Euclidean \(d\)-space, The number of polytopes, configurations and real matroids, Order on order types, Extreme point and halving edge search in abstract order types, Many empty triangles have a common edge, On the number of crossing-free partitions, Abstract order type extension and new results on the rectilinear crossing number, Drawing the almost convex set in an integer grid of minimum size, Tukey depth histograms, Carathéodory's theorem in depth, Reconstructing Point Set Order Typesfrom Radial Orderings, Reprint of: Extreme point and halving edge search in abstract order types, New lower bounds for Tverberg partitions with tolerance in the plane, Towards compatible triangulations., Erdős-Szekeres ``happy end-type theorems for separoïds, Approximating the Rectilinear Crossing Number, Crossing-Free Perfect Matchings in Wheel Point Sets, Ham-sandwich cuts for abstract order types, Representing finite convex geometries by relatively convex sets, Minimal representations of order types by geometric graphs, From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices, Unnamed Item, 4-holes in point sets, The complexity of point configurations, Some provably hard crossing number problems, Minimal Representations of Order Types by Geometric Graphs, Faradžev Read-type enumeration of non-isomorphic CC systems, Geodesic order types, On the distribution of order types, A pseudo-algorithmic separation of lines from pseudo-lines, On the number of order types in integer grids of small size, Pre-triangulations and liftable complexes, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), PROPERTIES OF ARRANGEMENT GRAPHS, On order types of systems of segments in the plane, Simple algorithms for partial point set pattern matching under rigid motion, POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION, Induced Ramsey-type results and binary predicates for point sets, Cutting convex curves, Clique-width of point configurations, A superlinear lower bound on the number of 5-holes, Necessary and sufficient conditions for hyperplane transversals, Counting polytopes via the Radon complex, Stabbing information of a simple polygon, Probabilistic aspects of some problems in combinatorial geometry, Realization of abstract convex geometries by point configurations, EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE, Approximating the rectilinear crossing number, Subquadratic Encodings for Point Configurations, Many order types on integer grids of polynomial size, Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model, Semispaces of configurations, cell complexes of arrangements, Homomorphisms of separoids, The topology of the space of transversals through the space of configurations, Spanned \(k\)-supporting hyperplanes of finite sets in \(\mathbb{R}^ d\), The power of geometric duality revisited, On the crossing number of complete graphs