write.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260
  1. #include <math.h>
  2. #include <grass/vector.h>
  3. #include <grass/glocale.h>
  4. #include "local_proto.h"
  5. static struct line_cats *PCats;
  6. static struct line_pnts *PPoints;
  7. static int point_cat = 1;
  8. static void write_line_forward(struct Map_info *, struct line_pnts *, int, int,
  9. int, double, dbDriver *, struct field_info *);
  10. static void write_line_backward(struct Map_info *, struct line_pnts *, int, int,
  11. int, double, dbDriver *, struct field_info *);
  12. void write_point(struct Map_info *Out, double x, double y, double z,
  13. int line_cat, double along, dbDriver *driver, struct field_info *Fi)
  14. {
  15. G_debug(3, "write_point()");
  16. if (!PPoints) {
  17. PCats = Vect_new_cats_struct();
  18. PPoints = Vect_new_line_struct();
  19. }
  20. else {
  21. Vect_reset_line(PPoints);
  22. Vect_reset_cats(PCats);
  23. }
  24. /* Write point */
  25. Vect_append_point(PPoints, x, y, z);
  26. if (line_cat > 0) {
  27. Vect_cat_set(PCats, 1, line_cat);
  28. Vect_cat_set(PCats, 2, point_cat);
  29. }
  30. else {
  31. Vect_cat_set(PCats, 2, point_cat);
  32. }
  33. Vect_write_line(Out, GV_POINT, PPoints, PCats);
  34. /* Attributes */
  35. if (Fi) {
  36. char buf[DB_SQL_MAX];
  37. dbString stmt;
  38. db_init_string(&stmt);
  39. if (line_cat > 0)
  40. sprintf(buf, "insert into %s values ( %d, %d, %.15g )", Fi->table,
  41. point_cat, line_cat, along);
  42. else
  43. sprintf(buf, "insert into %s values ( %d, %.15g )", Fi->table,
  44. point_cat, along);
  45. db_append_string(&stmt, buf);
  46. if (db_execute_immediate(driver, &stmt) != DB_OK) {
  47. G_warning(_("Unable to insert new record: '%s'"),
  48. db_get_string(&stmt));
  49. }
  50. }
  51. point_cat++;
  52. }
  53. void write_line(struct Map_info *Out, struct line_pnts *LPoints, int cat,
  54. int vertex, int interpolate, int reverse, double dmax,
  55. dbDriver *driver, struct field_info *Fi)
  56. {
  57. if (reverse == 0)
  58. write_line_forward(Out, LPoints, cat, vertex, interpolate, dmax,
  59. driver, Fi);
  60. else
  61. write_line_backward(Out, LPoints, cat, vertex, interpolate, dmax,
  62. driver, Fi);
  63. }
  64. static void write_line_forward(struct Map_info *Out, struct line_pnts *LPoints,
  65. int cat, int vertex, int interpolate,
  66. double dmax, dbDriver *driver,
  67. struct field_info *Fi)
  68. {
  69. if (vertex != 0) { /* use line vertices */
  70. double along;
  71. int vert;
  72. along = 0;
  73. for (vert = 0; vert < LPoints->n_points; vert++) {
  74. G_debug(3, "vert = %d", vert);
  75. if (vertex == GV_NODE && (vert > 0 && vert < LPoints->n_points - 1))
  76. continue;
  77. if (vertex == GV_START && vert > 0)
  78. return;
  79. if (vertex == GV_END && vert < LPoints->n_points - 1)
  80. continue;
  81. if (vert == LPoints->n_points - 1)
  82. along = Vect_line_length(LPoints);
  83. write_point(Out, LPoints->x[vert], LPoints->y[vert],
  84. LPoints->z[vert], cat, along, driver, Fi);
  85. if (vert < LPoints->n_points - 1) {
  86. double dx, dy, dz, len;
  87. dx = LPoints->x[vert + 1] - LPoints->x[vert];
  88. dy = LPoints->y[vert + 1] - LPoints->y[vert];
  89. dz = LPoints->z[vert + 1] - LPoints->z[vert];
  90. len = hypot(hypot(dx, dy), dz);
  91. /* interpolate segment */
  92. if (interpolate && vertex == GV_VERTEX) {
  93. int i, n;
  94. double x, y, z, dlen;
  95. if (len > dmax) {
  96. n = len / dmax + 1; /* number of segments */
  97. dx /= n;
  98. dy /= n;
  99. dz /= n;
  100. dlen = len / n;
  101. for (i = 1; i < n; i++) {
  102. x = LPoints->x[vert] + i * dx;
  103. y = LPoints->y[vert] + i * dy;
  104. z = LPoints->z[vert] + i * dz;
  105. write_point(Out, x, y, z, cat, along + i * dlen,
  106. driver, Fi);
  107. }
  108. }
  109. }
  110. along += len;
  111. }
  112. }
  113. }
  114. else { /* do not use vertices */
  115. int i, n;
  116. double len, dlen, along, x, y, z;
  117. len = Vect_line_length(LPoints);
  118. n = len / dmax + 1; /* number of segments */
  119. dlen = len / n; /* length of segment */
  120. G_debug(3, "n = %d len = %f dlen = %f", n, len, dlen);
  121. for (i = 0; i <= n; i++) {
  122. if (i > 0 && i < n) {
  123. along = i * dlen;
  124. Vect_point_on_line(LPoints, along, &x, &y, &z, NULL, NULL);
  125. }
  126. else { /* first and last vertex */
  127. if (i == 0) {
  128. along = 0;
  129. x = LPoints->x[0];
  130. y = LPoints->y[0];
  131. z = LPoints->z[0];
  132. }
  133. else { /* last */
  134. along = len;
  135. x = LPoints->x[LPoints->n_points - 1];
  136. y = LPoints->y[LPoints->n_points - 1];
  137. z = LPoints->z[LPoints->n_points - 1];
  138. }
  139. }
  140. G_debug(3, " i = %d along = %f", i, along);
  141. write_point(Out, x, y, z, cat, along, driver, Fi);
  142. }
  143. }
  144. }
  145. static void write_line_backward(struct Map_info *Out, struct line_pnts *LPoints,
  146. int cat, int vertex, int interpolate,
  147. double dmax, dbDriver *driver,
  148. struct field_info *Fi)
  149. {
  150. if (vertex == GV_VERTEX || vertex == GV_NODE) { /* use line vertices */
  151. double along;
  152. int vert;
  153. along = Vect_line_length(LPoints);
  154. for (vert = LPoints->n_points - 1; vert >= 0; vert--) {
  155. G_debug(3, "vert = %d", vert);
  156. if (vertex == GV_VERTEX ||
  157. (vertex == GV_NODE &&
  158. (vert == 0 || vert == LPoints->n_points - 1))) {
  159. if (vert == 0)
  160. along = 0;
  161. write_point(Out, LPoints->x[vert], LPoints->y[vert],
  162. LPoints->z[vert], cat, along, driver, Fi);
  163. }
  164. if (vert > 0) {
  165. double dx, dy, dz, len;
  166. dx = LPoints->x[vert - 1] - LPoints->x[vert];
  167. dy = LPoints->y[vert - 1] - LPoints->y[vert];
  168. dz = LPoints->z[vert - 1] - LPoints->z[vert];
  169. len = hypot(hypot(dx, dy), dz);
  170. /* interpolate segment */
  171. if (interpolate && vertex == GV_VERTEX) {
  172. int i, n;
  173. double x, y, z, dlen;
  174. if (len > dmax) {
  175. n = len / dmax + 1; /* number of segments */
  176. dx /= n;
  177. dy /= n;
  178. dz /= n;
  179. dlen = len / n;
  180. for (i = 1; i < n; i++) {
  181. x = LPoints->x[vert] + i * dx;
  182. y = LPoints->y[vert] + i * dy;
  183. z = LPoints->z[vert] + i * dz;
  184. write_point(Out, x, y, z, cat, along - i * dlen,
  185. driver, Fi);
  186. }
  187. }
  188. }
  189. along -= len;
  190. }
  191. }
  192. }
  193. else { /* do not use vertices */
  194. int i, n;
  195. double len, dlen, along, x, y, z;
  196. len = Vect_line_length(LPoints);
  197. n = len / dmax + 1; /* number of segments */
  198. dlen = len / n; /* length of segment */
  199. G_debug(3, "n = %d len = %f dlen = %f", n, len, dlen);
  200. for (i = 0; i <= n; i++) {
  201. if (i > 0 && i < n) {
  202. along = len - i * dlen;
  203. Vect_point_on_line(LPoints, along, &x, &y, &z, NULL, NULL);
  204. }
  205. else { /* first and last vertex */
  206. if (i == 0) {
  207. along = len;
  208. x = LPoints->x[LPoints->n_points - 1];
  209. y = LPoints->y[LPoints->n_points - 1];
  210. z = LPoints->z[LPoints->n_points - 1];
  211. }
  212. else { /* last */
  213. along = 0;
  214. x = LPoints->x[0];
  215. y = LPoints->y[0];
  216. z = LPoints->z[0];
  217. }
  218. }
  219. G_debug(3, " i = %d along = %f", i, along);
  220. write_point(Out, x, y, z, cat, along, driver, Fi);
  221. }
  222. }
  223. }