Browse Prior Art Database

Multidimensional Sorting

IP.com Disclosure Number: IPCOM000053355D
Original Publication Date: 1980-Jan-01
Included in the Prior Art Database: 2005-Feb-12

Publishing Venue

IBM

Related People

Authors:
Boinodiris, S [+details]

Abstract

Sorting has been defined as the process which receives an item list and produces an output item list which is said to be sorted if the same order relation applies to any two adjacent numbers of the list, i.e., /0/A: A1 greater than or equal to...........greater than or equal to An. Previous sorting methods have always dealt with sorting points in one dimensional space. The problem of multidimensional sorting, or the sorting of a set of points S: (Pk(X1,X2,.....,Xn) where k represents all these points in S), has not been considered in the past by any sorting method. This limitation in traditional sorting algorithms has been corrected by expanding the notion of sorting into multidimensional spaces. The concept of multidimensional vector sorting which leads to multidimensional sorting of sets of points is introduced.