-
Hi, I need to create a 3D periodic Delaunay mesh incrementally. This has to be done in an incremental way because I need to have the vertex handle, from which I can assign the info(). As the number of points increases, I realized that the mesh is automatically converted to 1-sheeted covering at some point. This should not be an issue, until I had to access the geometry of those "unique cells" near the boundary of the cuboid. These unique cells should have vertices that are outside the cuboid, which are actually periodic images of some points "rounded to the other side" of the cuboid. However, in 1-sheeted covering, the offset for all points are (0,0,0), without memory of their offsets in those unique cells near the boundary. These cells are therefore "stretched" and "intersecting" with other canonical cells, which is logically correct but geometrically strange. I can convert to 27-sheeted covering and resolve this issue. But that costs a lot of memory. Thanks. |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 1 reply
-
There are two types of offsets, which you have to distinguish between:
You could compute the geometric position manually, getting vh->offset() and cell->offset(int) and combining properly, but there are functions in the the triangulation class to do that for you:
Note that unique iterators work even in 1-sheet. |
Beta Was this translation helpful? Give feedback.
There are two types of offsets, which you have to distinguish between:
You could compute the geometric position manually, getting vh->offset() and cell->offset(int) a…