Method and apparatus for storing digital data representing a topological network

Claim 3

A data processing unit comprising a memory storing digital data representing a surface-wise-organized topological network, which network contains a set of 0-cells and 1-cells; each 1-cell being stored in a memory location at which data is also stored representing a first and a second 0-cell terminating such 1-cell, and thread pointer data for each 0-cell which indicates a single further 1-cell terminated by such 0-cell , each 0-cell terminating a subset of 1-cells arranged in a sequence of successive orientations; said thread pointer data indicating a 1-cell of next-following orientation in said subset according to a particular sense of rotation, such sense of rotation being uniform for all 0-cells in said set of 0-cells and 1-cells.

Claim 4

A data processing unit comprising a memory storing digital data representing a surface-wise-organized topological network, which network contains a set of 0-cells and 1-cells; each 1-cell being stored in a memory location at which data is also stored representing a first and a second 0-cell terminating such 1-cell, and thread pointer data for each 0-cell which indicates a single further 1-cell terminated by such 0-cell , each 0-cell terminating a subset of 1-cells arranged in a sequence of successive orientations; said thread pointer data indicating a 1-cell of next-following orientation in said subset according to a particular sense of rotation, such sense of rotation being uniform for all 0-cells in said set of 0-cells and 1-cells.

Claim 5

A method as claimed in claim 1, wherein said network furthermore contains a further set of 2-cells, characterized in that the memory location for said given 1-cell also contains an identification data identifying first and second 2-cells bounded by said given 1-cell.

Claim 6

A method as claimed in claim 3 for finding the 1-cells and the 0-cells which bound a particular 2-cell, characterized in that, on the basis of a first set formed by a first 1-cell of the network and one of its terminating 0-cells, there is formed a second set by addressing said first 1-cell in the memory and by selecting the other 0-cell terminating said first 1-cell and also the 1-cell indicated by the thread pointer assigned to said other 0-cell, said second set being used to form a third set by addressing the 1-cell of the second set in the memory, by taking that 0-cell terminating the addressed 1-cell which is not the 0-cell used for the second set, and by taking the 1-cell indicated by the thread pointer assigned to the latter other 0-cell, which third set is subsequently compared with the first set and, in the case of correspondence, the searched 2-cell is bounded by the first and the second set, while in the case of non-correspondence the second set is buffered and subsequently substituted by the third set in order to form, on the basis of the substituted second set, a further third set, which operations are repeated until the first set corresponds to a third set thus formed.

Claim 7

A method as claimed in claim 3 for finding the 1-cells and the 0-cells which bound 2-cell, characterized in that a second set is formed on the basis of a first set formed by a first set formed by a first 1-cell of the network and one of its terminating 0-cells by addressing said first 1-cell in the memory and by selecting the other 0-cell terminating said first 1-cell and also the 1-cell indicated by the thread pointer assigned to said other 0-cell, the 1-cell of the second set being subsequently addressed in the memory and the data fetched being examined in order to determine whether the first and the second 0-cell terminating the relevant 1-cell are identical, a third set being formed when the first and the second 0-cell are identical, which third set is formed by selecting the identical 0-cell and also the 1-cell, indicated by the thread pointer assigned to one of the two 0-cells, which differs from the 1-cell of the second set, in the case of non-identical first and second 0-cells the third set being formed by taking the other 0-cell terminating the addressed 1-cell which is not the 0-cell used in the second set and by taking also the 1cell indicated by the thread pointer assigned to the latter other 0-cell, which third set is subsequently compared with the first set and, in the case of correspondence, the 2-cell searched is bounded by the first, the second and the third set, while in the case of non-correspondence the second set is buffered and subsequently substituted by the third set in order to form a further third set on the basis of the substituted second set, said operations being repeated until the first set corresponds to a third set thus formed.

Claim 8

A method as claimed in claim 5, characterized in that the first 1-cell of the first set in the memory is addressed, the data fetched being examined in order to determine whether the first and the second 0-cell terminating the first 1-cell are identical, in the case of identical first and second 0-cells the 2-cell to be found being that one which is enclosed by the first 1-cell.

Claim 10

A method as claimed in claim 1, 3, 4, 5 or 6 used for a topological network comprising at least one 1-cell which is formed by a closed loop, characterized in that a virtual 0-cell is provided at a point of a closed loop, which point differs from a junction 0-cell which indicates the connection of the relevant closed loop to a further 1-cell of the network, the closed loop being stored as a first and a second sub-1-cell, the first and the second 0-cell indicated for the first sub-1-cell being formed by the junction 0-cell and the virtual 0-cell, respectively, the first and the second 0-cell indicated for the second sub-1-cell being formed by the virtual 0-cell and the junction 0-cell respectively.

Claim 11

A data processing unit as claimed in claim 2, wherein said network further contains at least one 1-cell which is formed by a closed loop, characterized in that a virtual 0-cell is provided at a point of said closed loop, which point differs from a junction 0-cell which indicated the connection of said closed loop to a further 1-cell of the network, the closed loop being stored as a first and a second sub-1-cell, the first and the second 0-cells each terminated by first and second 0-cells, terminating the first sub-1-cell being the junction 0-cell and the virtual 0-cell, respectively, the first and the second 0-cells terminating the second sub-1-cell being the virtual 0-cell and the junction 0-cell respectively.

Claim 12

A data processing unit as claimed in claim 2 or 9, wherein said network further contains a set of 2-cells, characterized in that at the memory location for each given 1-cell there is further stored identification data identifying first and second 2-cells as bounded by such 1-cell.