CVPR Daily - Thursday

The B-rep data structure is defined around oriented edges call coedges. In the data structure, some relationships are known about the neighboring coedges which are in the model. For example, there are pointers pointing to the next coedge in the loop around the face and the previous coedge in the loop around the face. Also, there is the mating coedge on the adjacent face. This tells us which faces are next to which other faces. There are also pointers to the parent face and the parent edge. With graph neural networks like the traditional message passing networks, the ordering of these different nodes around this red node in the middle is unclear, so you must use symmetric aggregation functions in order to combine 7 DAILY CVPR Thursday Joseph Lambourne Face