-
Notifications
You must be signed in to change notification settings - Fork 3
Home
Some of the commands below (marked below with [selection]) work only on a defined part of the map.
CreateMap-
CreateNormalMap[selection] ImportMapImportMapFromDDS-
ExportMap[selection] -
ExportMapToDDS[selection] -
CopyMap[selection] -
MoveMap[todo] -
AddMap[todo] -
SubstractMap[todo] DeleteMap-
MergeMap[todo]
-
SetHeight[selection] GetHeight-
FillColorMap[entire map] -
Filter[entire map] -
MakeDerivatives[entire map] DiamondSquare-
ScaleMap[entire map]
SetVertexReadDataFileSetGridSetGridBorderSetAtGridLineContourLinePanorama-
SetAlgVertices: sets Monte-Carlo points based on algorithms -
InactivateAllVertices: diables all vertices in [selection] ActivateFractionOfVertices-
RemoveInactiveVertices: removes the inactive vertices.
Create algorithm chains:
The common options (-add, -multiply and -alg) and the calculation of values of chained algorithms are explained on the [basic algorithm page](wiki/Algorithm Basics)
AlgConstAlgLayerAlgLinearAlgRadialAlgFirstOrderAlgSecondOrderAlgPeakFinder-
AlgEquation[M$ version only]
See also the [comparison of different algorithms](wiki/Comparisons of algorithms).
SetFlag-
QuadIterator[makes a selection] -
CellIterator[works on selection, makes a new selection] FileIterator
-
MakeTriangulation: makes a Delaunay triangulation. Frezzes most of the vertex commands, and opens the possibility to modify and export the mesh. -
RemoveTriangulation: removes the triangulation.
SplitAt-
SplitAtZ[selection] SplitBetweenSplitAtGrid-
ActivateVisibleVertices: re-activates only the visible vertices. -
RemoveInactiveTriangles: removes the triangles which have only deactivated vertices. SortTriangles
Polygons are user-defined shapes embedded into the created mesh. They can be used to stencil out shapes. See polygon page for details.
Done before the triangulation:
Done after the triangulation:
An extensible math expression parser with plug-ins (MTParser) by Mathieu Jacques
Triangle: "Engineering a 2D Quality Mesh Generator and Delaunay Triangulator", in "Applied Computational Geometry: Towards Geometric Engineering" (Ming C. Lin and Dinesh Manocha, editors), volume 1148 of Lecture Notes in Computer Science, pages 203-222, Springer-Verlag, Berlin, May 1996" by J. R. Shewchuk
imageresampler, a C++ class for separable filtering 2D image resampling by Rich Geldreich.
crunch/crnlib, for dds file generation.
Mesh Viewer by Helmut Cantzler
P. Pourke, "Triangulate: Efficient Triangulation Algorithm Suitable for Terrain Modelling", Presented at Pan Pacific Computer Conference, Beijing, China. January 1989, see link: http://paulbourke.net/papers/triangulate/
A. James Stewart, "Tunneling for Triangle Strips in Continuous "Level-of-Detail Meshes", Published in: Proceedings GRIN'01
M. B. Porcu, and R. Scateni, "An Iterative Stripification Algorithm Based on Dual Graph Operations", EUROGRAPHICS 2003
M. B. Porcu, N. Sanna and R. Scateni, "Efficiently keeping an optimal stripification over a CLOD mesh", The Journal of WSCG, Vol.13