126bd1501SBarry Smith #if !defined(PETSCDMPLEXTYPES_H) 226bd1501SBarry Smith #define PETSCDMPLEXTYPES_H 386fe8405SMatthew G. Knepley 49318fe57SMatthew G. Knepley /*E 59318fe57SMatthew G. Knepley DMPlexShape - The domain shape used for automatic mesh creation. 69318fe57SMatthew G. Knepley 79318fe57SMatthew G. Knepley Existing shapes include 89318fe57SMatthew G. Knepley $ DM_SHAPE_BOX - The tensor product of intervals in dimension d 99318fe57SMatthew G. Knepley $ DM_SHAPE_BOX_SURFACE - The surface of a box in dimension d+1 109318fe57SMatthew G. Knepley $ DM_SHAPE_BALL - The d-dimensional ball 119318fe57SMatthew G. Knepley $ DM_SHAPE_SPHERE - The surface of the (d+1)-dimensional ball 129318fe57SMatthew G. Knepley $ DM_SHAPE_CYLINDER - The tensor product of the interval and disk 13b7f5c055SJed Brown $ DM_SHAPE_SCHWARZ_P - The Schwarz-P triply periodic minimal surface 14b7f5c055SJed Brown $ DM_SHAPE_GYROID - The Gyroid triply periodic minimal surface 1505bd46c0SStefano Zampini $ DM_SHAPE_DOUBLET - The mesh of two cells of a specified type 169318fe57SMatthew G. Knepley 179318fe57SMatthew G. Knepley Level: beginner 189318fe57SMatthew G. Knepley 199318fe57SMatthew G. Knepley .seealso: DMPlexGetCellRefiner(), DMPlexSetCellRefiner(), DMRefine(), DMPolytopeType 209318fe57SMatthew G. Knepley E*/ 2105bd46c0SStefano Zampini typedef enum {DM_SHAPE_BOX, DM_SHAPE_BOX_SURFACE, DM_SHAPE_BALL, DM_SHAPE_SPHERE, DM_SHAPE_CYLINDER, DM_SHAPE_SCHWARZ_P, DM_SHAPE_GYROID, DM_SHAPE_DOUBLET, DM_SHAPE_UNKNOWN} DMPlexShape; 229318fe57SMatthew G. Knepley PETSC_EXTERN const char * const DMPlexShapes[]; 239318fe57SMatthew G. Knepley 245a107427SMatthew G. Knepley /*E 255a107427SMatthew G. Knepley DMPlexCSRAlgorithm - The algorithm for building the adjacency graph in CSR format, usually for a mesh partitioner 265a107427SMatthew G. Knepley 275a107427SMatthew G. Knepley Existing shapes include 285a107427SMatthew G. Knepley $ DM_PLEX_CSR_MAT - Use MatPartition by first making a matrix 295a107427SMatthew G. Knepley $ DM_PLEX_CSR_GRAPH - Use the original Plex and communicate along the boundary 305a107427SMatthew G. Knepley $ DM_PLEX_CSR_OVERLAP - Build an overlapped Plex and then locally compute 315a107427SMatthew G. Knepley 325a107427SMatthew G. Knepley Level: beginner 335a107427SMatthew G. Knepley 345a107427SMatthew G. Knepley .seealso: DMPlexCreatePartitionerGraph(), PetscPartitionerDMPlexPartition(), DMPlexDistribute() 355a107427SMatthew G. Knepley E*/ 365a107427SMatthew G. Knepley typedef enum {DM_PLEX_CSR_MAT, DM_PLEX_CSR_GRAPH, DM_PLEX_CSR_OVERLAP} DMPlexCSRAlgorithm; 375a107427SMatthew G. Knepley PETSC_EXTERN const char * const DMPlexCSRAlgorithms[]; 385a107427SMatthew G. Knepley 39*c50b2d26SMatthew G. Knepley typedef struct _p_DMPlexPointQueue *DMPlexPointQueue; 40*c50b2d26SMatthew G. Knepley struct _p_DMPlexPointQueue { 41*c50b2d26SMatthew G. Knepley PetscInt size; /* Size of the storage array */ 42*c50b2d26SMatthew G. Knepley PetscInt *points; /* Array of mesh points */ 43*c50b2d26SMatthew G. Knepley PetscInt front; /* Index of the front of the queue */ 44*c50b2d26SMatthew G. Knepley PetscInt back; /* Index of the back of the queue */ 45*c50b2d26SMatthew G. Knepley PetscInt num; /* Number of enqueued points */ 46*c50b2d26SMatthew G. Knepley }; 47*c50b2d26SMatthew G. Knepley 4886fe8405SMatthew G. Knepley #endif 49