p4est  1.1
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
File List
Here is a list of all documented files with brief descriptions:
[detail level 123]
o-example
|o-p6est
||o*p6est.hA hybrid 2D+1D AMR extension
||o*p6est_extended.hInterface routines with extended capabilities
||o*p6est_ghost.hPassing columns of layers and data to neighboring processes
||o*p6est_io.h
||o*p6est_lnodes.h
||o*p6est_profile.h
||\*p6est_vtk.h
|\-steps
| o*hw32.hThis file containts the image data used in the step1 example
| o*p4est_step1.cThis 2D example program refines a domain based on given image data
| o*p4est_step2.cThis 2D example program refines a domain given by an ABAQUS .inp file
| o*p4est_step3.cThis 2D example program uses p4est to solve a simple advection problem
| o*p4est_step4.cThis 2D example program solves the Poisson equation using finite elements
| o*p8est_step1.cThis 3D example program refines a domain based on given image data
| o*p8est_step2.cThis 3D example program refines a domain given by an ABAQUS .inp file
| o*p8est_step3.cThis 3D example program uses p4est to solve a simple advection problem
| \*p8est_step4.cThis 3D example program solves the Poisson equation using finite elements
o-sc
|\-src
| o*sc.hSupport for process management (memory allocation, logging, etc.)
| \*sc_containers.hDefines lists, arrays, hash tables, etc
\-src
 o*p4est.hThe top-level 2D p4est interface
 o*p4est_algorithms.h
 o*p4est_balance.h
 o*p4est_base.hGeneral support types and functions
 o*p4est_bits.hRoutines for manipulating quadrants (neighbors, parents, children, etc.)
 o*p4est_communication.h
 o*p4est_connectivity.hThe coarse topological description of the forest
 o*p4est_extended.hInterface routines with extended capabilities
 o*p4est_geometry.cWe provide the identity transformation for reference
 o*p4est_geometry.hTransforms from vertex frame to physical space
 o*p4est_ghost.hPassing quadrants and data to neighboring processes
 o*p4est_io.h
 o*p4est_iterate.hIteration over mesh topology via callbacks
 o*p4est_lnodes.h
 o*p4est_mesh.hForest topology in a conventional mesh format
 o*p4est_nodes.h
 o*p4est_plex.h
 o*p4est_points.h
 o*p4est_search.h
 o*p4est_to_p8est.hTransforms 2D p4est routines into 3D p8est routines
 o*p4est_vtk.hRoutines for printing a forest and associated fields to vtk format
 o*p4est_wrap.h
 o*p8est.hThe top-level 3D p8est interface
 o*p8est_algorithms.h
 o*p8est_balance.h
 o*p8est_bits.hRoutines for manipulating quadrants (neighbors, parents, children, etc.)
 o*p8est_communication.h
 o*p8est_connectivity.hThe coarse topological description of the forest
 o*p8est_extended.hInterface routines with extended capabilities
 o*p8est_geometry.cWe provide some geometry transformations for the builtin connectivities
 o*p8est_geometry.hTransforms from vertex frame to physical space
 o*p8est_ghost.hPassing quadrants and data to neighboring processes
 o*p8est_io.h
 o*p8est_iterate.hIteration over mesh topology via callbacks
 o*p8est_lnodes.h
 o*p8est_mesh.hForest topology in a conventional mesh format
 o*p8est_nodes.h
 o*p8est_plex.h
 o*p8est_points.h
 o*p8est_search.h
 o*p8est_tets_hexes.h
 o*p8est_vtk.hRoutines for printing a forest and associated fields to vtk format
 \*p8est_wrap.h