main.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895
  1. /****************************************************************
  2. *
  3. * MODULE: v.buffer
  4. *
  5. * AUTHOR(S): Radim Blazek
  6. * Upgraded by Rosen Matev (Google Summer of Code 2008)
  7. * OGR support by Martin Landa <landa.martin gmail.com> (2009)
  8. * rewrite and GEOS added by Markus Metz
  9. *
  10. * PURPOSE: Vector buffer
  11. *
  12. * COPYRIGHT: (C) 2001-2014 by the GRASS Development Team
  13. *
  14. * This program is free software under the GNU General
  15. * Public License (>=v2). Read the file COPYING that
  16. * comes with GRASS for details.
  17. *
  18. **************************************************************/
  19. #include <stdlib.h>
  20. #include <string.h>
  21. #include <unistd.h>
  22. #include <math.h>
  23. #include <grass/gis.h>
  24. #include <grass/vector.h>
  25. #include <grass/dbmi.h>
  26. #include <grass/glocale.h>
  27. #include "local_proto.h"
  28. #define PI M_PI
  29. #ifndef MIN
  30. #define MIN(X,Y) ((X<Y)?X:Y)
  31. #endif
  32. #ifndef MAX
  33. #define MAX(X,Y) ((X>Y)?X:Y)
  34. #endif
  35. /* returns 1 if unit_tolerance is adjusted, 0 otherwise */
  36. int adjust_tolerance(double *tolerance)
  37. {
  38. double t = 0.999 * (1 - cos(PI / 8));
  39. G_debug(2, "Maximum tolerance = %f", t);
  40. if (*tolerance > t) {
  41. *tolerance = t;
  42. return 1;
  43. }
  44. return 0;
  45. }
  46. int db_CatValArray_get_value_di(dbCatValArray * cvarr, int cat, double *value)
  47. {
  48. int t;
  49. int ctype = cvarr->ctype;
  50. int ret;
  51. if (ctype == DB_C_TYPE_INT) {
  52. ret = db_CatValArray_get_value_int(cvarr, cat, &t);
  53. if (ret != DB_OK)
  54. return ret;
  55. *value = (double)t;
  56. return DB_OK;
  57. }
  58. if (ctype == DB_C_TYPE_DOUBLE) {
  59. ret = db_CatValArray_get_value_double(cvarr, cat, value);
  60. return ret;
  61. }
  62. return DB_FAILED;
  63. }
  64. int point_in_buffer(struct buf_contours *arr_bc, struct spatial_index *si,
  65. struct Map_info *Buf, double x, double y)
  66. {
  67. int i, j, ret, flag;
  68. struct bound_box bbox;
  69. static struct ilist *List = NULL;
  70. static struct line_pnts *Points = NULL;
  71. static struct line_cats *BCats = NULL;
  72. if (List == NULL)
  73. List = Vect_new_list();
  74. if (Points == NULL)
  75. Points = Vect_new_line_struct();
  76. if (BCats == NULL)
  77. BCats = Vect_new_cats_struct();
  78. /* select outer contours overlapping with centroid (x, y) */
  79. bbox.W = bbox.E = x;
  80. bbox.N = bbox.S = y;
  81. bbox.T = PORT_DOUBLE_MAX;
  82. bbox.B = -PORT_DOUBLE_MAX;
  83. Vect_spatial_index_select(si, &bbox, List);
  84. for (i = 0; i < List->n_values; i++) {
  85. Vect_read_line(Buf, Points, BCats, arr_bc[List->value[i]].outer);
  86. ret = Vect_point_in_poly(x, y, Points);
  87. if (ret == 0)
  88. continue;
  89. flag = 1;
  90. for (j = 0; j < arr_bc[List->value[i]].inner_count; j++) {
  91. if (arr_bc[List->value[i]].inner[j] < 1)
  92. continue;
  93. Vect_read_line(Buf, Points, NULL, arr_bc[List->value[i]].inner[j]);
  94. ret = Vect_point_in_poly(x, y, Points);
  95. if (ret != 0) { /* inside inner contour */
  96. flag = 0;
  97. break;
  98. }
  99. }
  100. if (flag) {
  101. /* (x,y) is inside outer contour and outside inner contours of arr_bc[i] */
  102. return 1;
  103. }
  104. }
  105. return 0;
  106. }
  107. int buffer_cats(struct buf_contours *arr_bc, struct spatial_index *si,
  108. struct Map_info *Buf, double x, double y, struct line_cats *Cats)
  109. {
  110. int i, j, ret, flag, inside;
  111. struct bound_box bbox;
  112. static struct ilist *List = NULL;
  113. static struct line_pnts *Points = NULL;
  114. static struct line_cats *BCats = NULL;
  115. if (List == NULL)
  116. List = Vect_new_list();
  117. if (Points == NULL)
  118. Points = Vect_new_line_struct();
  119. if (BCats == NULL)
  120. BCats = Vect_new_cats_struct();
  121. /* select outer contours overlapping with centroid (x, y) */
  122. bbox.W = bbox.E = x;
  123. bbox.N = bbox.S = y;
  124. bbox.T = PORT_DOUBLE_MAX;
  125. bbox.B = -PORT_DOUBLE_MAX;
  126. Vect_spatial_index_select(si, &bbox, List);
  127. Vect_reset_cats(Cats);
  128. inside = 0;
  129. for (i = 0; i < List->n_values; i++) {
  130. Vect_read_line(Buf, Points, BCats, arr_bc[List->value[i]].outer);
  131. ret = Vect_point_in_poly(x, y, Points);
  132. if (ret == 0)
  133. continue;
  134. flag = 1;
  135. for (j = 0; j < arr_bc[List->value[i]].inner_count; j++) {
  136. if (arr_bc[List->value[i]].inner[j] < 1)
  137. continue;
  138. Vect_read_line(Buf, Points, NULL, arr_bc[List->value[i]].inner[j]);
  139. ret = Vect_point_in_poly(x, y, Points);
  140. if (ret != 0) { /* inside inner contour */
  141. flag = 0;
  142. break;
  143. }
  144. }
  145. if (flag) {
  146. /* (x,y) is inside outer contour and outside inner contours of arr_bc[i] */
  147. inside = 1;
  148. for (j = 0; j < BCats->n_cats; j++)
  149. Vect_cat_set(Cats, BCats->field[j], BCats->cat[j]);
  150. }
  151. }
  152. return inside;
  153. }
  154. int main(int argc, char *argv[])
  155. {
  156. struct Map_info In, Out, Buf;
  157. struct line_pnts *Points;
  158. struct line_cats *Cats, *BCats, *CCats;
  159. struct GModule *module;
  160. struct Option *in_opt, *out_opt, *type_opt, *dista_opt, *distb_opt,
  161. *angle_opt;
  162. struct Flag *straight_flag, *nocaps_flag, *cats_flag;
  163. struct Option *tol_opt, *bufcol_opt, *scale_opt, *field_opt,
  164. *where_opt, *cats_opt;
  165. struct cat_list *cat_list = NULL;
  166. int verbose, use_geos;
  167. double da, db, dalpha, tolerance, unit_tolerance;
  168. int type;
  169. int i, ret, nareas, area, nlines, line;
  170. char *Areas, *Lines;
  171. int field;
  172. struct buf_contours *arr_bc;
  173. int arr_bc_alloc;
  174. struct buf_contours_pts arr_bc_pts;
  175. int line_id, buffers_count = 0;
  176. struct spatial_index si;
  177. struct bound_box bbox;
  178. /* Attributes if sizecol is used */
  179. int nrec, ctype;
  180. struct field_info *Fi = NULL;
  181. dbDriver *Driver;
  182. dbCatValArray cvarr;
  183. double size_val, scale;
  184. #ifdef HAVE_GEOS
  185. /* TODO: use GEOSBufferParams * */
  186. #endif
  187. module = G_define_module();
  188. G_add_keyword(_("vector"));
  189. G_add_keyword(_("buffer"));
  190. G_add_keyword(_("geometry"));
  191. module->description =
  192. _("Creates a buffer around vector features of given type.");
  193. in_opt = G_define_standard_option(G_OPT_V_INPUT);
  194. field_opt = G_define_standard_option(G_OPT_V_FIELD_ALL);
  195. field_opt->guisection = _("Selection");
  196. cats_opt = G_define_standard_option(G_OPT_V_CATS);
  197. cats_opt->guisection = _("Selection");
  198. where_opt = G_define_standard_option(G_OPT_DB_WHERE);
  199. where_opt->guisection = _("Selection");
  200. type_opt = G_define_standard_option(G_OPT_V_TYPE);
  201. type_opt->options = "point,line,boundary,centroid,area";
  202. type_opt->answer = "point,line,area";
  203. type_opt->guisection = _("Selection");
  204. out_opt = G_define_standard_option(G_OPT_V_OUTPUT);
  205. dista_opt = G_define_option();
  206. dista_opt->key = "distance";
  207. dista_opt->type = TYPE_DOUBLE;
  208. dista_opt->required = NO;
  209. dista_opt->description =
  210. _("Buffer distance along major axis in map units");
  211. dista_opt->guisection = _("Distance");
  212. distb_opt = G_define_option();
  213. distb_opt->key = "minordistance";
  214. distb_opt->type = TYPE_DOUBLE;
  215. distb_opt->required = NO;
  216. distb_opt->description =
  217. _("Buffer distance along minor axis in map units");
  218. distb_opt->guisection = _("Distance");
  219. angle_opt = G_define_option();
  220. angle_opt->key = "angle";
  221. angle_opt->type = TYPE_DOUBLE;
  222. angle_opt->required = NO;
  223. angle_opt->answer = "0";
  224. angle_opt->description = _("Angle of major axis in degrees");
  225. angle_opt->guisection = _("Distance");
  226. bufcol_opt = G_define_standard_option(G_OPT_DB_COLUMN);
  227. bufcol_opt->description =
  228. _("Name of column to use for buffer distances");
  229. bufcol_opt->guisection = _("Distance");
  230. scale_opt = G_define_option();
  231. scale_opt->key = "scale";
  232. scale_opt->type = TYPE_DOUBLE;
  233. scale_opt->required = NO;
  234. scale_opt->answer = "1.0";
  235. scale_opt->description = _("Scaling factor for attribute column values");
  236. scale_opt->guisection = _("Distance");
  237. tol_opt = G_define_option();
  238. tol_opt->key = "tolerance";
  239. tol_opt->type = TYPE_DOUBLE;
  240. tol_opt->required = NO;
  241. tol_opt->answer = "0.01";
  242. tol_opt->description =
  243. _("Maximum distance between theoretical arc and polygon segments as multiple of buffer");
  244. tol_opt->guisection = _("Distance");
  245. straight_flag = G_define_flag();
  246. straight_flag->key = 's';
  247. straight_flag->description = _("Make outside corners straight");
  248. nocaps_flag = G_define_flag();
  249. nocaps_flag->key = 'c';
  250. nocaps_flag->description = _("Do not make caps at the ends of polylines");
  251. cats_flag = G_define_flag();
  252. cats_flag->key = 't';
  253. cats_flag->description = _("Transfer categories and attributes");
  254. cats_flag->guisection = _("Attributes");
  255. G_gisinit(argv[0]);
  256. if (G_parser(argc, argv))
  257. exit(EXIT_FAILURE);
  258. verbose = G_verbose();
  259. #if !defined HAVE_GEOS
  260. use_geos = FALSE;
  261. #else
  262. use_geos = getenv("GRASS_VECTOR_BUFFER") ? FALSE : TRUE;
  263. #endif
  264. G_debug(1, "use_geos = %d", use_geos);
  265. type = Vect_option_to_types(type_opt);
  266. /* TODO: no geodesic support yet in GEOS */
  267. if (G_projection() == PROJECTION_LL)
  268. G_important_message(_("Note: In latitude-longitude coordinate system specify distances in degree unit"));
  269. if ((dista_opt->answer && bufcol_opt->answer) ||
  270. (!(dista_opt->answer || bufcol_opt->answer)))
  271. G_fatal_error(_("Select a buffer distance/minordistance/angle "
  272. "or column, but not both."));
  273. Vect_check_input_output_name(in_opt->answer, out_opt->answer, G_FATAL_EXIT);
  274. Vect_set_open_level(2); /* topology required */
  275. Vect_open_old2(&In, in_opt->answer, "", field_opt->answer);
  276. Vect_set_error_handler_io(&In, &Out);
  277. if (field_opt->answer)
  278. field = Vect_get_field_number(&In, field_opt->answer);
  279. else
  280. field = -1;
  281. if ((cats_opt->answer || where_opt->answer) && field == -1) {
  282. G_warning(_("Invalid layer number (%d). Parameter '%s' or '%s' specified, assuming layer '1'."),
  283. field, cats_opt->key, where_opt->key);
  284. field = 1;
  285. }
  286. cat_list = NULL;
  287. if (field > 0)
  288. cat_list = Vect_cats_set_constraint(&In, field, where_opt->answer,
  289. cats_opt->answer);
  290. if (bufcol_opt->answer && field == -1)
  291. G_fatal_error(_("The bufcol option requires a valid layer."));
  292. tolerance = atof(tol_opt->answer);
  293. if (tolerance <= 0)
  294. G_fatal_error(_("The tolerance must be > 0."));
  295. if (adjust_tolerance(&tolerance))
  296. G_warning(_("The tolerance was reset to %g"), tolerance);
  297. scale = atof(scale_opt->answer);
  298. if (scale <= 0.0)
  299. G_fatal_error(_("Illegal scale value"));
  300. da = db = dalpha = unit_tolerance = 0;
  301. if (dista_opt->answer) {
  302. da = atof(dista_opt->answer);
  303. if (distb_opt->answer)
  304. db = atof(distb_opt->answer);
  305. else
  306. db = da;
  307. if (angle_opt->answer)
  308. dalpha = atof(angle_opt->answer);
  309. else
  310. dalpha = 0;
  311. unit_tolerance = fabs(tolerance * MIN(da, db));
  312. G_verbose_message(_("The tolerance in map units = %g"), unit_tolerance);
  313. }
  314. Vect_open_new(&Out, out_opt->answer, WITHOUT_Z);
  315. Points = Vect_new_line_struct();
  316. Cats = Vect_new_cats_struct();
  317. BCats = Vect_new_cats_struct();
  318. CCats = Vect_new_cats_struct();
  319. /* open tmp vector for buffers, needed for cleaning */
  320. if (0 > Vect_open_tmp_new(&Buf, NULL, WITHOUT_Z)) {
  321. G_fatal_error(_("Unable to create vector map"));
  322. }
  323. G_set_verbose(0);
  324. Vect_build_partial(&Buf, GV_BUILD_BASE); /* switch to level 2 */
  325. G_set_verbose(verbose);
  326. /* check and load attribute column data */
  327. if (bufcol_opt->answer) {
  328. db_CatValArray_init(&cvarr);
  329. Fi = Vect_get_field(&In, field);
  330. if (Fi == NULL)
  331. G_fatal_error(_("Database connection not defined for layer %d"),
  332. field);
  333. Driver = db_start_driver_open_database(Fi->driver, Fi->database);
  334. if (Driver == NULL)
  335. G_fatal_error(_("Unable to open database <%s> by driver <%s>"),
  336. Fi->database, Fi->driver);
  337. db_set_error_handler_driver(Driver);
  338. /* Note do not check if the column exists in the table because it may be expression */
  339. /* TODO: only select values we need instead of all in column */
  340. nrec =
  341. db_select_CatValArray(Driver, Fi->table, Fi->key,
  342. bufcol_opt->answer, NULL, &cvarr);
  343. if (nrec < 0)
  344. G_fatal_error(_("Unable to select data from table <%s>"),
  345. Fi->table);
  346. G_debug(2, "%d records selected from table", nrec);
  347. ctype = cvarr.ctype;
  348. if (ctype != DB_C_TYPE_INT && ctype != DB_C_TYPE_DOUBLE)
  349. G_fatal_error(_("Column type not supported"));
  350. db_close_database_shutdown_driver(Driver);
  351. /* Output cats/values list */
  352. for (i = 0; i < cvarr.n_values; i++) {
  353. if (ctype == DB_C_TYPE_INT) {
  354. G_debug(4, "cat = %d val = %d", cvarr.value[i].cat,
  355. cvarr.value[i].val.i);
  356. }
  357. else if (ctype == DB_C_TYPE_DOUBLE) {
  358. G_debug(4, "cat = %d val = %f", cvarr.value[i].cat,
  359. cvarr.value[i].val.d);
  360. }
  361. }
  362. }
  363. Vect_copy_head_data(&In, &Out);
  364. Vect_hist_copy(&In, &Out);
  365. Vect_hist_command(&Out);
  366. /* Create buffers' boundaries */
  367. nlines = nareas = 0;
  368. if ((type & GV_POINTS) || (type & GV_LINES))
  369. nlines = Vect_get_num_primitives(&In, type);
  370. if (type & GV_AREA)
  371. nareas = Vect_get_num_areas(&In);
  372. if (nlines + nareas == 0) {
  373. G_warning(_("No features available for buffering. "
  374. "Check type option and features available in the input vector."));
  375. exit(EXIT_SUCCESS);
  376. }
  377. /* init arr_bc */
  378. buffers_count = 1;
  379. arr_bc_alloc = nlines + nareas + 1;
  380. arr_bc = G_calloc(arr_bc_alloc, sizeof(struct buf_contours));
  381. Vect_spatial_index_init(&si, 0);
  382. #ifdef HAVE_GEOS
  383. initGEOS(G_message, G_fatal_error);
  384. #endif
  385. if(!use_geos && (da < 0. || db < 0.)) {
  386. G_warning(_("Negative distances for internal buffers are not supported "
  387. "and converted to positive values."));
  388. da = fabs(da);
  389. db = fabs(db);
  390. }
  391. /* Areas */
  392. if (nareas > 0) {
  393. int centroid;
  394. G_message(_("Buffering areas..."));
  395. for (area = 1; area <= nareas; area++) {
  396. int cat;
  397. G_percent(area, nareas, 2);
  398. if (!Vect_area_alive(&In, area))
  399. continue;
  400. centroid = Vect_get_area_centroid(&In, area);
  401. if (centroid == 0)
  402. continue;
  403. Vect_read_line(&In, NULL, Cats, centroid);
  404. if (field > 0 && !Vect_cats_in_constraint(Cats, field, cat_list))
  405. continue;
  406. Vect_reset_cats(CCats);
  407. for (i = 0; i < Cats->n_cats; i++) {
  408. if (field < 0 || Cats->field[i] == field) {
  409. Vect_cat_set(CCats, Cats->field[i], Cats->cat[i]);
  410. }
  411. }
  412. if (bufcol_opt->answer) {
  413. Vect_cat_get(Cats, field, &cat);
  414. ret = db_CatValArray_get_value_di(&cvarr, cat, &size_val);
  415. if (ret != DB_OK) {
  416. G_warning(_("No record for category %d in table <%s>"),
  417. cat, Fi->table);
  418. continue;
  419. }
  420. if (size_val < 0.0) {
  421. G_warning(_("Attribute is of invalid size (%.3f) for category %d"),
  422. size_val, cat);
  423. continue;
  424. }
  425. if (size_val == 0.0)
  426. continue;
  427. da = size_val * scale;
  428. db = da;
  429. dalpha = 0;
  430. unit_tolerance = fabs(tolerance * MIN(da, db));
  431. G_debug(2, " dynamic buffer size = %.2f", da);
  432. G_debug(2, _("The tolerance in map units: %g"),
  433. unit_tolerance);
  434. }
  435. #ifdef HAVE_GEOS
  436. if (use_geos)
  437. geos_buffer(&In, &Out, &Buf, area, GV_AREA, da,
  438. &si, CCats, &arr_bc, &buffers_count, &arr_bc_alloc);
  439. #endif
  440. if (!use_geos) {
  441. Vect_area_buffer2(&In, area, da, db, dalpha,
  442. !(straight_flag->answer),
  443. !(nocaps_flag->answer), unit_tolerance,
  444. &(arr_bc_pts.oPoints),
  445. &(arr_bc_pts.iPoints),
  446. &(arr_bc_pts.inner_count));
  447. Vect_write_line(&Out, GV_BOUNDARY, arr_bc_pts.oPoints, BCats);
  448. line_id = Vect_write_line(&Buf, GV_BOUNDARY, arr_bc_pts.oPoints, CCats);
  449. Vect_destroy_line_struct(arr_bc_pts.oPoints);
  450. /* add buffer to spatial index */
  451. Vect_get_line_box(&Buf, line_id, &bbox);
  452. Vect_spatial_index_add_item(&si, buffers_count, &bbox);
  453. arr_bc[buffers_count].outer = line_id;
  454. arr_bc[buffers_count].inner_count = arr_bc_pts.inner_count;
  455. if (arr_bc_pts.inner_count > 0) {
  456. arr_bc[buffers_count].inner = G_malloc(arr_bc_pts.inner_count * sizeof(int));
  457. for (i = 0; i < arr_bc_pts.inner_count; i++) {
  458. Vect_write_line(&Out, GV_BOUNDARY, arr_bc_pts.iPoints[i], BCats);
  459. line_id = Vect_write_line(&Buf, GV_BOUNDARY, arr_bc_pts.iPoints[i], BCats);
  460. Vect_destroy_line_struct(arr_bc_pts.iPoints[i]);
  461. arr_bc[buffers_count].inner[i] = line_id;
  462. }
  463. G_free(arr_bc_pts.iPoints);
  464. }
  465. buffers_count++;
  466. } /* native buffer end */
  467. }
  468. }
  469. /* Lines (and Points) */
  470. if (nlines > 0) {
  471. int ltype;
  472. G_message(_("Buffering features..."));
  473. if (da < 0 || db < 0) {
  474. G_warning(_("Negative distances are only supported for areas"));
  475. da = fabs(da);
  476. db = fabs(db);
  477. }
  478. nlines = Vect_get_num_lines(&In);
  479. for (line = 1; line <= nlines; line++) {
  480. int cat;
  481. G_debug(2, "line = %d", line);
  482. G_percent(line, nlines, 2);
  483. if (!Vect_line_alive(&In, line))
  484. continue;
  485. ltype = Vect_read_line(&In, Points, Cats, line);
  486. if (!(ltype & type))
  487. continue;
  488. if (field > 0 && !Vect_cats_in_constraint(Cats, field, cat_list))
  489. continue;
  490. Vect_reset_cats(CCats);
  491. for (i = 0; i < Cats->n_cats; i++) {
  492. if (field < 0 || Cats->field[i] == field) {
  493. Vect_cat_set(CCats, Cats->field[i], Cats->cat[i]);
  494. }
  495. }
  496. if (bufcol_opt->answer) {
  497. Vect_cat_get(Cats, field, &cat);
  498. ret = db_CatValArray_get_value_di(&cvarr, cat, &size_val);
  499. if (ret != DB_OK) {
  500. G_warning(_("No record for category %d in table <%s>"),
  501. cat, Fi->table);
  502. continue;
  503. }
  504. if (size_val < 0.0) {
  505. G_warning(_("Attribute is of invalid size (%.3f) for category %d"),
  506. size_val, cat);
  507. continue;
  508. }
  509. if (size_val == 0.0)
  510. continue;
  511. da = size_val * scale;
  512. if (da < 0) {
  513. G_warning(_("Negative distances are only supported for areas"));
  514. da = fabs(da);
  515. }
  516. db = da;
  517. dalpha = 0;
  518. unit_tolerance = tolerance * MIN(da, db);
  519. G_debug(2, " dynamic buffer size = %.2f", da);
  520. G_debug(2, _("The tolerance in map units: %g"),
  521. unit_tolerance);
  522. }
  523. Vect_line_prune(Points);
  524. if (ltype & GV_POINTS || Points->n_points == 1) {
  525. Vect_point_buffer2(Points->x[0], Points->y[0], da, db, dalpha,
  526. !(straight_flag->answer), unit_tolerance,
  527. &(arr_bc_pts.oPoints));
  528. Vect_write_line(&Out, GV_BOUNDARY, arr_bc_pts.oPoints, BCats);
  529. line_id = Vect_write_line(&Buf, GV_BOUNDARY, arr_bc_pts.oPoints, CCats);
  530. Vect_destroy_line_struct(arr_bc_pts.oPoints);
  531. /* add buffer to spatial index */
  532. Vect_get_line_box(&Buf, line_id, &bbox);
  533. Vect_spatial_index_add_item(&si, buffers_count, &bbox);
  534. arr_bc[buffers_count].outer = line_id;
  535. arr_bc[buffers_count].inner_count = 0;
  536. arr_bc[buffers_count].inner = NULL;
  537. buffers_count++;
  538. }
  539. else {
  540. #ifdef HAVE_GEOS
  541. if (use_geos)
  542. geos_buffer(&In, &Out, &Buf, line, type, da,
  543. &si, CCats, &arr_bc, &buffers_count, &arr_bc_alloc);
  544. #endif
  545. if (!use_geos) {
  546. Vect_line_buffer2(Points, da, db, dalpha,
  547. !(straight_flag->answer),
  548. !(nocaps_flag->answer), unit_tolerance,
  549. &(arr_bc_pts.oPoints),
  550. &(arr_bc_pts.iPoints),
  551. &(arr_bc_pts.inner_count));
  552. Vect_write_line(&Out, GV_BOUNDARY, arr_bc_pts.oPoints, BCats);
  553. line_id = Vect_write_line(&Buf, GV_BOUNDARY, arr_bc_pts.oPoints, CCats);
  554. Vect_destroy_line_struct(arr_bc_pts.oPoints);
  555. /* add buffer to spatial index */
  556. Vect_get_line_box(&Buf, line_id, &bbox);
  557. Vect_spatial_index_add_item(&si, buffers_count, &bbox);
  558. arr_bc[buffers_count].outer = line_id;
  559. arr_bc[buffers_count].inner_count = arr_bc_pts.inner_count;
  560. if (arr_bc_pts.inner_count > 0) {
  561. arr_bc[buffers_count].inner = G_malloc(arr_bc_pts.inner_count * sizeof(int));
  562. for (i = 0; i < arr_bc_pts.inner_count; i++) {
  563. Vect_write_line(&Out, GV_BOUNDARY, arr_bc_pts.iPoints[i], BCats);
  564. line_id = Vect_write_line(&Buf, GV_BOUNDARY, arr_bc_pts.iPoints[i], BCats);
  565. Vect_destroy_line_struct(arr_bc_pts.iPoints[i]);
  566. arr_bc[buffers_count].inner[i] = line_id;
  567. }
  568. G_free(arr_bc_pts.iPoints);
  569. }
  570. buffers_count++;
  571. } /* native buffer end */
  572. }
  573. }
  574. }
  575. #ifdef HAVE_GEOS
  576. finishGEOS();
  577. #endif
  578. G_message(_("Cleaning buffers..."));
  579. /* Break lines */
  580. G_message(_("Building parts of topology..."));
  581. Vect_build_partial(&Out, GV_BUILD_BASE);
  582. /* Warning: snapping must be done, otherwise colinear boundaries are not broken and
  583. * topology cannot be built (the same angle). But snapping distance must be very, very
  584. * small, otherwise counterclockwise boundaries can appear in areas outside the buffer.
  585. * I have done some tests on real data (projected) and threshold 1e-8 was not enough,
  586. * Snapping threshold 1e-7 seems to work. Don't increase until we find example
  587. * where it is not sufficient. RB */
  588. /* TODO: look at snapping threshold better, calculate some theoretical value to avoid
  589. * the same angles of lines at nodes, don't forget about LongLat data, probably
  590. * calculate different threshold for each map, depending on map's bounding box
  591. * and/or distance and tolerance */
  592. G_message(_("Snapping boundaries..."));
  593. Vect_snap_lines(&Out, GV_BOUNDARY, 1e-7, NULL);
  594. G_message(_("Breaking polygons..."));
  595. Vect_break_polygons(&Out, GV_BOUNDARY, NULL);
  596. G_message(_("Removing duplicates..."));
  597. Vect_remove_duplicates(&Out, GV_BOUNDARY, NULL);
  598. do {
  599. G_message(_("Breaking boundaries..."));
  600. Vect_break_lines(&Out, GV_BOUNDARY, NULL);
  601. G_message(_("Removing duplicates..."));
  602. Vect_remove_duplicates(&Out, GV_BOUNDARY, NULL);
  603. G_message(_("Cleaning boundaries at nodes"));
  604. } while (Vect_clean_small_angles_at_nodes(&Out, GV_BOUNDARY, NULL) > 0);
  605. /* Dangles and bridges don't seem to be necessary if snapping is small enough. */
  606. /* Still needed for larger buffer distances ? */
  607. Vect_build_partial(&Out, GV_BUILD_AREAS);
  608. G_message(_("Removing dangles..."));
  609. Vect_remove_dangles(&Out, GV_BOUNDARY, -1, NULL);
  610. G_message (_("Removing bridges..."));
  611. Vect_remove_bridges(&Out, NULL, NULL, NULL);
  612. G_message(_("Attaching islands..."));
  613. Vect_build_partial(&Out, GV_BUILD_ATTACH_ISLES);
  614. if (!cats_flag->answer) {
  615. /* Calculate new centroids for all areas */
  616. nareas = Vect_get_num_areas(&Out);
  617. Areas = (char *)G_calloc(nareas + 1, sizeof(char));
  618. G_message(_("Calculating centroids for all areas..."));
  619. G_percent(0, nareas, 2);
  620. for (area = 1; area <= nareas; area++) {
  621. double x, y;
  622. G_percent(area, nareas, 2);
  623. G_debug(3, "area = %d", area);
  624. if (!Vect_area_alive(&Out, area))
  625. continue;
  626. ret = Vect_get_point_in_area(&Out, area, &x, &y);
  627. if (ret < 0) {
  628. G_warning(_("Cannot calculate area centroid"));
  629. continue;
  630. }
  631. ret = point_in_buffer(arr_bc, &si, &Buf, x, y);
  632. if (ret) {
  633. G_debug(3, " -> in buffer");
  634. Areas[area] = 1;
  635. }
  636. }
  637. /* Make a list of boundaries to be deleted (both sides inside) */
  638. nlines = Vect_get_num_lines(&Out);
  639. G_debug(3, "nlines = %d", nlines);
  640. Lines = (char *)G_calloc(nlines + 1, sizeof(char));
  641. G_message(_("Generating list of boundaries to be deleted..."));
  642. for (line = 1; line <= nlines; line++) {
  643. int j, side[2], areas[2];
  644. G_percent(line, nlines, 2);
  645. G_debug(3, "line = %d", line);
  646. if (!Vect_line_alive(&Out, line))
  647. continue;
  648. Vect_get_line_areas(&Out, line, &side[0], &side[1]);
  649. for (j = 0; j < 2; j++) {
  650. if (side[j] == 0) { /* area/isle not build */
  651. areas[j] = 0;
  652. }
  653. else if (side[j] > 0) { /* area */
  654. areas[j] = side[j];
  655. }
  656. else { /* < 0 -> island */
  657. areas[j] = Vect_get_isle_area(&Out, abs(side[j]));
  658. }
  659. }
  660. G_debug(3, " areas = %d , %d -> Areas = %d, %d", areas[0], areas[1],
  661. Areas[areas[0]], Areas[areas[1]]);
  662. if (Areas[areas[0]] && Areas[areas[1]])
  663. Lines[line] = 1;
  664. }
  665. G_free(Areas);
  666. /* Delete boundaries */
  667. G_message(_("Deleting boundaries..."));
  668. for (line = 1; line <= nlines; line++) {
  669. G_percent(line, nlines, 2);
  670. if (!Vect_line_alive(&Out, line))
  671. continue;
  672. if (Lines[line]) {
  673. G_debug(3, " delete line %d", line);
  674. Vect_delete_line(&Out, line);
  675. }
  676. else {
  677. /* delete incorrect boundaries */
  678. int side[2];
  679. Vect_get_line_areas(&Out, line, &side[0], &side[1]);
  680. if (!side[0] && !side[1]) {
  681. G_debug(3, " delete line %d", line);
  682. Vect_delete_line(&Out, line);
  683. }
  684. }
  685. }
  686. G_free(Lines);
  687. }
  688. /* Create new centroids */
  689. Vect_reset_cats(Cats);
  690. Vect_cat_set(Cats, 1, 1);
  691. nareas = Vect_get_num_areas(&Out);
  692. G_message(_("Calculating centroids for areas..."));
  693. for (area = 1; area <= nareas; area++) {
  694. double x, y;
  695. G_percent(area, nareas, 2);
  696. G_debug(3, "area = %d", area);
  697. if (!Vect_area_alive(&Out, area))
  698. continue;
  699. ret = Vect_get_point_in_area(&Out, area, &x, &y);
  700. if (ret < 0) {
  701. G_warning(_("Unable to calculate centroid for area %d"), area);
  702. continue;
  703. }
  704. if (cats_flag->answer)
  705. ret = buffer_cats(arr_bc, &si, &Buf, x, y, Cats);
  706. else
  707. ret = point_in_buffer(arr_bc, &si, &Buf, x, y);
  708. if (ret) {
  709. Vect_reset_line(Points);
  710. Vect_append_point(Points, x, y, 0.);
  711. Vect_write_line(&Out, GV_CENTROID, Points, Cats);
  712. }
  713. }
  714. Vect_spatial_index_destroy(&si);
  715. Vect_close(&Buf);
  716. if (cats_flag->answer)
  717. Vect_copy_tables(&In, &Out, field);
  718. Vect_close(&In);
  719. Vect_build_partial(&Out, GV_BUILD_NONE);
  720. Vect_build(&Out);
  721. Vect_close(&Out);
  722. exit(EXIT_SUCCESS);
  723. }