A data structure to represent data sets with more than one order relation like polygons

This paper introduces a new data structure useful to represent objects or data sets with several order relations between their elements.A specific case is the polygons that will be analyzed in this paper.Polygons are objects often used in Computer Graphics and their operations have a high computational cost; this data structure was implemented in Java language with a performance O(n*log(n)) corresponding to building and O(log(n)) to searching.The complexity analysis for insertion and searching routines are explained.