Ensuring the drawability of extended Euler diagrams for up to 8 sets

摘要: This paper shows by a constructive method the existence of diagrammatic representation called extended Euler diagrams for any collection sets X 1,...,X n , n<9. These are adapted representing inclusions and intersections: each set i non empty intersection subcollection is represented unique connected region plane. Starting with an abstract description diagram, we define dual graph G reason properties this to build planar . will be used visualize results complex request on indexed video databases. In fact, such allows user perceive simultaneously his query relevance database according query.