[cig-commits] commit:
Mercurial
hg at geodynamics.org
Mon Nov 24 11:58:40 PST 2008
changeset: 70:085c968bf217
user: JulianGiordani
date: Thu Apr 03 07:05:15 2008 +0000
files: Geometry/src/Delaunay.meta Geometry/src/IrregGeometry.meta Geometry/src/ParallelDelaunay.meta Mesh/src/CommTopology.meta Mesh/src/MeshAdaptor.meta Mesh/src/SurfaceAdaptor.meta Swarm/src/GaussParticleLayout.meta Swarm/src/UnionParticleLayout.meta
description:
Updating these guys because they had broken html bits in eh.
As we are using the xalan parser for creating the codex it is hyper sensitive to bad html.
diff -r 89762723eed3 -r 085c968bf217 Geometry/src/Delaunay.meta
--- a/Geometry/src/Delaunay.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Geometry/src/Delaunay.meta Thu Apr 03 07:05:15 2008 +0000
@@ -12,7 +12,7 @@
<param name="License">https://csd.vpac.org/twiki/bin/view/Stgermain/SoftwareLicense</param>
<param name="Parent">Stg_Component</param>
<param name="Reference">...</param>
-<param name="Summary">The Constrained Delaunay Algorithm performs Delaunay triangulation on a set of 2D points. It also generates a dual graph (Voronoi diagram) and a Convex Hull.<br>Single-processor version - good for small data sets or where speed is not critical.</param>
+<param name="Summary">The Constrained Delaunay Algorithm performs Delaunay triangulation on a set of 2D points. It also generates a dual graph (Voronoi diagram) and a Convex Hull.<br/>Single-processor version - good for small data sets or where speed is not critical.</param>
<param name="Description"><p>Delaunay works on a set of 2D points. It uses the Constrained Delaunay Algorithm to generate a network between these points.</p><p>Once that step is complete it generates a dual graph, a Voronoi Diagram, based on the Delaunay Triangulation.</p><p>Delaunay can also generate a Convex Hull based on the set of points.</p><p>This is a single-processor implementation of Delaunay. Use ParallelDelaunay on a multi-processor system for large data sets, speed-critical applications or where memory resources are limited.</p>
</param>
diff -r 89762723eed3 -r 085c968bf217 Geometry/src/IrregGeometry.meta
--- a/Geometry/src/IrregGeometry.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Geometry/src/IrregGeometry.meta Thu Apr 03 07:05:15 2008 +0000
@@ -5,8 +5,8 @@
<param name="Name">IrregGeometry</param>
<param name="Author">...</param>
<param name="Organisation">VPAC</param>
-<param name="Project">StGermain</param>
-<param name="Location">./StGermain/Discretisation/Geometry/src/</param>
+<param name="Project">StDomain</param>
+<param name="Location">./StGermain/Geometry/src/</param>
<param name="Project Web">https://csd.vpac.org/twiki/bin/view/Stgermain/WebHome</param>
<param name="Copyright">StGermain Framework. Copyright (C) 2003-2005 VPAC.</param>
<param name="License">The Gnu Lesser General Public License http://www.gnu.org/licenses/lgpl.html</param>
@@ -15,7 +15,7 @@
<param name="Summary">Imports mesh coordinates from a file and applies them to a mesh.</param>
<param name="Description"><p>IrregGeometry reads in a set of arbitrary points from a file and applies them to the geometry of a mesh. This makes it ideal for importing mesh data produced by another tool, such as a third-party application. As the name of this Code implies, the geometry of this mesh can be irregular.</p>
-<p>IrregGeometry retrieves ListName from the Root Directory. This lets it locate an XML file containing listing of (x, y, z) points in a simple format, typically inside an <asciidata> element.</p>
+<p>IrregGeometry retrieves ListName from the Root Directory. This lets it locate an XML file containing listing of (x, y, z) points in a simple format, typically inside an <asciidata> element.</p>
</param>
<!--Now the interesting stuff-->
diff -r 89762723eed3 -r 085c968bf217 Geometry/src/ParallelDelaunay.meta
--- a/Geometry/src/ParallelDelaunay.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Geometry/src/ParallelDelaunay.meta Thu Apr 03 07:05:15 2008 +0000
@@ -5,14 +5,14 @@
<param name="Name">ParallelDelaunay</param>
<param name="Author">...</param>
<param name="Organisation">VPAC</param>
-<param name="Project">StGermain</param>
-<param name="Location">./StGermain/Discretisation/Geometry/src/</param>
+<param name="Project">StgDomain</param>
+<param name="Location">./StgDomain/Geometry/src/</param>
<param name="Project Web">https://csd.vpac.org/twiki/bin/view/Stgermain/WebHome</param>
<param name="Copyright">StGermain Framework. Copyright (C) 2003-2005 VPAC.</param>
<param name="License">https://csd.vpac.org/twiki/bin/view/Stgermain/SoftwareLicense</param>
<param name="Parent">Delaunay</param>
<param name="Reference">...</param>
-<param name="Summary">The Constrained Delaunay Algorithm performs Delaunay triangulation on a set of 2D points. It also generates a dual graph (Voronoi diagram) and a Convex Hull.<br> Multi-processor version, good for large data sets or where speed is critical.</param>
+<param name="Summary">The Constrained Delaunay Algorithm performs Delaunay triangulation on a set of 2D points. It also generates a dual graph (Voronoi diagram) and a Convex Hull.<br/> Multi-processor version, good for large data sets or where speed is critical.</param>
<param name="Description"><p>Delaunay works on a set of 2D points. It uses the Constrained Delaunay Algorithm to generate a network between these points.</p>
<p> Once that step is complete it generates a dual graph, a Voronoi Diagram, based on the Delaunay Triangulation.</p>
diff -r 89762723eed3 -r 085c968bf217 Mesh/src/CommTopology.meta
--- a/Mesh/src/CommTopology.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Mesh/src/CommTopology.meta Thu Apr 03 07:05:15 2008 +0000
@@ -12,7 +12,7 @@
<param name="License">The Gnu Lesser General Public License http://www.gnu.org/licenses/lgpl.html</param>
<param name="Parent">Stg_Component</param>
<param name="Reference">...</param>
-<param name="Summary">Finds and identifies neighbours of a processor.<br>Can lead to more elegant and efficient design.</param>
+<param name="Summary">Finds and identifies neighbours of a processor.<br/>Can lead to more elegant and efficient design.</param>
<param name="Description"><p>CommTopology is a tool that helps to find and identify the neighbours of a processor. It is useful for hugely parallel operations, such as those distributed over thousands of processors.</p><p>Typically, a processor only needs to communicate with adjacent processors. A global (one-to-all) operation is an example of a poorly designed operation because it calls for unnecessary communication beyond the scope of the processor's neighbourhood. In this situation, redesigning the operation and using CommTopology would be a more elegant design and lead to improved efficiency.</p></param>
</StGermainData>
diff -r 89762723eed3 -r 085c968bf217 Mesh/src/MeshAdaptor.meta
--- a/Mesh/src/MeshAdaptor.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Mesh/src/MeshAdaptor.meta Thu Apr 03 07:05:15 2008 +0000
@@ -15,14 +15,14 @@
<param name="Summary">A plug-in that lets you modify the output of a MeshGenerator without changing its code.</param>
<param name="Description"><p>A MeshAdaptor is a customisable component that can be inserted into the mesh generation pipeline. An Adaptor permits you modify the output from different types of mesh generators without modifying the code of a mesh generator. Conceptually, an adaptor can be viewed as a filter or an addition to the output stage.</p>
-<p><br>MeshGenerator --> MeshAdaptor --> Mesh</p>
+<p><br/>MeshGenerator --> MeshAdaptor --> Mesh</p>
<p>Note that one or more MeshAdaptors may be inserted into the process, and there is no theoretical limit to the number of MeshAdaptors. In practise, using more than three or four MeshAdaptors may add a prohibitive overhead and could be grounds for optimisation by removing or combining adaptors.
This modular approach allows a small set of MeshAdaptors to be plugged-in in many combinations for a wide range of effects.</p>
<p>SurfaceAdaptor is an example of a MeshAdaptor. It allows you to modify the top surface without changing the underlying layers. Presently, it's the only MeshAdaptor, but it makes for a useful case study and other MeshAdaptors can be constructed in future.</p>
-<p>Each MeshAdaptor is active on its local processor as part of that processor's pipeline. Generally, an even mesh decomposition will lead to processor-load being balanced and processors keeping in synch with their neighbours, but there is no restriction on how a MeshAdaptor can operate. Inserting additional steps where there are dependencies on other processors and pipelines can result in a pipeline stall. This may be the case if there is extensive interaction between processors, as in the following example:<p>
+<p>Each MeshAdaptor is active on its local processor as part of that processor's pipeline. Generally, an even mesh decomposition will lead to processor-load being balanced and processors keeping in synch with their neighbours, but there is no restriction on how a MeshAdaptor can operate. Inserting additional steps where there are dependencies on other processors and pipelines can result in a pipeline stall. This may be the case if there is extensive interaction between processors, as in the following example:</p>
<p>Generating a Mesh with four processors and modifying it with two MeshAdaptors.
MeshGenerator1 --> MeshAdaptor1a --> MeshAdaptor1b --> Mesh1
diff -r 89762723eed3 -r 085c968bf217 Mesh/src/SurfaceAdaptor.meta
--- a/Mesh/src/SurfaceAdaptor.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Mesh/src/SurfaceAdaptor.meta Thu Apr 03 07:05:15 2008 +0000
@@ -17,10 +17,10 @@
<p>SurfaceAdaptor is an example of a MeshAdaptor. It allows you to modify the top surface without changing the underlying layers. Presently, it's the only MeshAdaptor, but it makes for a useful case study and other MeshAdaptors can be constructed in future.</p>
-<p> <br>Questions: Is SurfaceAdaptor useful when dealing with conditions with highly stratified materials?
+<p> <br/>Questions: Is SurfaceAdaptor useful when dealing with conditions with highly stratified materials?
Where forces acting on material being modelled only affect the surface and don't penetrate the bulk of the material?
Useful as a quick approximation because you're interested only in examining the surface?
-TODO: Does it stricktly deal with the top layer only, or can you set the depth to which the SurfaceAdaptor goes? This has implications for mesh deformation, level of detail, size of â€œcellsâ€ etc.
+TODO: Does it stricktly deal with the top layer only, or can you set the depth to which the SurfaceAdaptor goes? This has implications for mesh deformation, level of detail, size of â€œcellsâ€ etc.</p>
</param>
</StGermainData>
diff -r 89762723eed3 -r 085c968bf217 Swarm/src/GaussParticleLayout.meta
--- a/Swarm/src/GaussParticleLayout.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Swarm/src/GaussParticleLayout.meta Thu Apr 03 07:05:15 2008 +0000
@@ -12,8 +12,8 @@
<param name="License">The Gnu Lesser General Public License http://www.gnu.org/licenses/lgpl.html</param>
<param name="Parent">PerCellParticleLayout</param>
<param name="Reference">...</param>
-<param name="Summary">...</a></param>
-<param name="Description">Lays out particles on points optimised for integrating over a cell. This layout also sets the particle weights as well. See <a HREF=â€http://mathworld.wolfram.com/Legendre-GaussQuadrature.htmlâ€>http://mathworld.wolfram.com/Legendre-GaussQuadrature.html</a><l</param>
+<param name="Summary">...</param>
+<param name="Description">Lays out particles on points optimised for integrating over a cell. This layout also sets the particle weights as well. See <a HREF="http://mathworld.wolfram.com/Legendre-GaussQuadrature.html">here</a></param>
<!--Now the interesting stuff-->
<list name="Params">
diff -r 89762723eed3 -r 085c968bf217 Swarm/src/UnionParticleLayout.meta
--- a/Swarm/src/UnionParticleLayout.meta Mon Mar 31 05:41:53 2008 +0000
+++ b/Swarm/src/UnionParticleLayout.meta Thu Apr 03 07:05:15 2008 +0000
@@ -12,7 +12,7 @@
<param name="License">https://csd.vpac.org/twiki/bin/view/Stgermain/SoftwareLicense</param>
<param name="Parent">GlobalParticleLayout</param>
<param name="Reference">...</param>
-<param name="Summary">A particle layout that sequentially combines many particle layouts.<br>When one particle layout finishes initialising all its particles then the next one begins.</param>
+<param name="Summary">A particle layout that sequentially combines many particle layouts.<br/>When one particle layout finishes initialising all its particles then the next one begins.</param>
<param name="Description">This is a particle layout that simply combines many particle layouts together into one. When one particle layout finishes initialises all its particles, then the next one begins.</param>
<list name="Params">
More information about the CIG-COMMITS
mailing list