Multidimensional Sorting

DOI10.1137/0212032zbMath0525.68038WikidataQ56815620 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

62H30: Classification and discrimination; cluster analysis (statistical aspects)

68P10: Searching and sorting

68T10: Pattern recognition, speech recognition

51A20: Configuration theorems in linear incidence geometry

Related Items

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