ThermalWeathering.cs 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107
  1. /*
  2. * Copyright (c) Contributors, http://opensimulator.org/
  3. * See CONTRIBUTORS.TXT for a full list of copyright holders.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. * * Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * * Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. * * Neither the name of the OpenSim Project nor the
  13. * names of its contributors may be used to endorse or promote products
  14. * derived from this software without specific prior written permission.
  15. *
  16. * THIS SOFTWARE IS PROVIDED BY THE DEVELOPERS ``AS IS'' AND ANY
  17. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  18. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  19. * DISCLAIMED. IN NO EVENT SHALL THE CONTRIBUTORS BE LIABLE FOR ANY
  20. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  21. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  22. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  23. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  24. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  25. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  26. */
  27. namespace libTerrain
  28. {
  29. partial class Channel
  30. {
  31. /// <summary>
  32. /// A thermal weathering implementation based on Musgrave's original 1989 algorithm. This is Adam's custom implementation which may differ slightly from the original.
  33. /// </summary>
  34. /// <param name="talus">The rock angle (represented as a dy/dx ratio) at which point it will be succeptible to breakage</param>
  35. /// <param name="rounds">The number of erosion rounds</param>
  36. /// <param name="c">The amount of rock to carry each round</param>
  37. public Channel ThermalWeathering(double talus, int rounds, double c)
  38. {
  39. SetDiff();
  40. double[,] lastFrame;
  41. double[,] thisFrame;
  42. lastFrame = (double[,]) map.Clone();
  43. thisFrame = (double[,]) map.Clone();
  44. NeighbourSystem type = NeighbourSystem.Moore;
  45. // Using moore neighbourhood (twice as computationally expensive)
  46. int NEIGHBOUR_ME = 4; // I am always 4 in both systems.
  47. int NEIGHBOUR_MAX = type == NeighbourSystem.Moore ? 9 : 5;
  48. int frames = rounds; // Number of thermal erosion iterations to run
  49. int i, j;
  50. int x, y;
  51. for (i = 0; i < frames; i++)
  52. {
  53. for (x = 0; x < w; x++)
  54. {
  55. for (y = 0; y < h; y++)
  56. {
  57. for (j = 0; j < NEIGHBOUR_MAX; j++)
  58. {
  59. if (j != NEIGHBOUR_ME)
  60. {
  61. int[] coords = Neighbours(type, j);
  62. coords[0] += x;
  63. coords[1] += y;
  64. if (coords[0] > w - 1)
  65. coords[0] = w - 1;
  66. if (coords[1] > h - 1)
  67. coords[1] = h - 1;
  68. if (coords[0] < 0)
  69. coords[0] = 0;
  70. if (coords[1] < 0)
  71. coords[1] = 0;
  72. double heightF = thisFrame[x, y];
  73. double target = thisFrame[coords[0], coords[1]];
  74. if (target > heightF + talus)
  75. {
  76. double calc = c*((target - heightF) - talus);
  77. heightF += calc;
  78. target -= calc;
  79. }
  80. thisFrame[x, y] = heightF;
  81. thisFrame[coords[0], coords[1]] = target;
  82. }
  83. }
  84. }
  85. }
  86. lastFrame = (double[,]) thisFrame.Clone();
  87. }
  88. map = thisFrame;
  89. Normalise(); // Just to guaruntee a smooth 0..1 value
  90. return this;
  91. }
  92. }
  93. }