1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
/*
This file is part of p4est.
p4est is a C library to manage a collection (a forest) of multiple
connected adaptive quadtrees or octrees in parallel.
Copyright (C) 2010 The University of Texas System
Additional copyright (C) 2011 individual authors
Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
p4est is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
p4est is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with p4est; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/********************************************************************
* IMPORTANT NOTE *
* *
* The p4est_points functionality depends on sc/src/sc_sort. *
* That parallel bitonic sort is still buggy (see sc/bugs). *
* If you want to use this code you have to fix the sort first. *
********************************************************************/
/*
* Usage: p8est_points <configuration> <level> <prefix>
* possible configurations:
* o unit The unit cube.
* o periodic The unit cube with all-periodic boundary conditions.
* o rotwrap The unit cube with various self-periodic b.c.
* o twocubes Two connected cubes.
* o rotcubes A collection of four connected rotated cubes.
*/
#include <p4est_to_p8est.h>
#include "points2.c"
|
