1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474
|
/*!
\file area.c
\brief Vector library - area feature related fns
Higher level functions for reading/writing/manipulating vectors.
(C) 2001-2008 by the GRASS Development Team
This program is free software under the
GNU General Public License (>=v2).
Read the file COPYING that comes with GRASS
for details.
\author Original author CERL, probably Dave Gerdes or Mike Higgins.
Update to GRASS 5.7 Radim Blazek and David D. Gray.
\date 2001-2008
*/
#include <stdlib.h>
#include <grass/gis.h>
#include <grass/Vect.h>
#include <grass/glocale.h>
/*!
\brief Returns the polygon array of points in BPoints
\param Map vector map
\param area area id
\param[out] BPoints points array
\return number of points
\return -1 on error
*/
int
Vect_get_area_points(struct Map_info *Map,
int area, struct line_pnts *BPoints)
{
int i, line, aline, dir;
struct Plus_head *Plus;
P_AREA *Area;
static int first_time = 1;
static struct line_pnts *Points;
G_debug(3, "Vect_get_area_points(): area = %d", area);
BPoints->n_points = 0;
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL) { /* dead area */
G_warning(_("Attempt to read points of nonexistent area"));
return -1; /* error , because we should not read dead areas */
}
if (first_time == 1) {
Points = Vect_new_line_struct();
first_time = 0;
}
G_debug(3, " n_lines = %d", Area->n_lines);
for (i = 0; i < Area->n_lines; i++) {
line = Area->lines[i];
aline = abs(line);
G_debug(3, " append line(%d) = %d", i, line);
if (0 > Vect_read_line(Map, Points, NULL, aline)) {
G_fatal_error("Cannot read line %d", aline);
}
G_debug(3, " line n_points = %d", Points->n_points);
if (line > 0)
dir = GV_FORWARD;
else
dir = GV_BACKWARD;
Vect_append_points(BPoints, Points, dir);
if (i != (Area->n_lines - 1)) /* all but not last */
BPoints->n_points--;
G_debug(3, " area n_points = %d", BPoints->n_points);
}
return (BPoints->n_points);
}
/*!
\brief Returns the polygon array of points in BPoints
\param Map vector map
\param isle island id
\param[out] BPoints points array
\return number of points or -1 on error
*/
int
Vect_get_isle_points(struct Map_info *Map,
int isle, struct line_pnts *BPoints)
{
int i, line, aline, dir;
struct Plus_head *Plus;
P_ISLE *Isle;
static int first_time = 1;
static struct line_pnts *Points;
G_debug(3, "Vect_get_isle_points(): isle = %d", isle);
BPoints->n_points = 0;
Plus = &(Map->plus);
Isle = Plus->Isle[isle];
if (first_time == 1) {
Points = Vect_new_line_struct();
first_time = 0;
}
G_debug(3, " n_lines = %d", Isle->n_lines);
for (i = 0; i < Isle->n_lines; i++) {
line = Isle->lines[i];
aline = abs(line);
G_debug(3, " append line(%d) = %d", i, line);
if (0 > Vect_read_line(Map, Points, NULL, aline)) {
G_fatal_error(_("Unable to read line %d"), aline);
}
G_debug(3, " line n_points = %d", Points->n_points);
if (line > 0)
dir = GV_FORWARD;
else
dir = GV_BACKWARD;
Vect_append_points(BPoints, Points, dir);
if (i != (Isle->n_lines - 1)) /* all but not last */
BPoints->n_points--;
G_debug(3, " isle n_points = %d", BPoints->n_points);
}
return (BPoints->n_points);
}
/*!
\brief Returns centroid number of area
\param Map vector map
\param area area id
\return centroid number of area
\return 0 if no centroid found
*/
int Vect_get_area_centroid(struct Map_info *Map, int area)
{
struct Plus_head *Plus;
P_AREA *Area;
G_debug(3, "Vect_get_area_centroid(): area = %d", area);
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL)
G_fatal_error(_("Attempt to read topo for dead area (%d)"), area);
return (Area->centroid);
}
/*!
\brief Creates list of boundaries for area
\param Map vector map
\param area area id
\param List pointer to list of boundaries
\return number of boundaries
*/
int
Vect_get_area_boundaries(struct Map_info *Map, int area, struct ilist *List)
{
int i, line;
struct Plus_head *Plus;
P_AREA *Area;
G_debug(3, "Vect_get_area_boundaries(): area = %d", area);
Vect_reset_list(List);
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL)
G_fatal_error(_("Attempt to read topo for dead area (%d)"), area);
for (i = 0; i < Area->n_lines; i++) {
line = Area->lines[i];
Vect_list_append(List, line);
}
return (List->n_values);
}
/*!
\brief Creates list of boundaries for isle
\param Map vector map
\param isle island number
\param List pointer to list where boundaries are stored
\return number of boundaries
*/
int
Vect_get_isle_boundaries(struct Map_info *Map, int isle, struct ilist *List)
{
int i, line;
struct Plus_head *Plus;
P_ISLE *Isle;
G_debug(3, "Vect_get_isle_boundaries(): isle = %d", isle);
Vect_reset_list(List);
Plus = &(Map->plus);
Isle = Plus->Isle[isle];
if (Isle == NULL)
G_fatal_error("Attempt to read topo for dead isle (%d)", isle);
for (i = 0; i < Isle->n_lines; i++) {
line = Isle->lines[i];
Vect_list_append(List, line);
}
return (List->n_values);
}
/*!
\brief Returns number of isles for area
\param Map vector map
\param area area id
\return number of isles for area
\return 0 if area not found
*/
int Vect_get_area_num_isles(struct Map_info *Map, int area)
{
struct Plus_head *Plus;
P_AREA *Area;
G_debug(3, "Vect_get_area_num_isles(): area = %d", area);
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL)
G_fatal_error(_("Attempt to read topo for dead area (%d)"), area);
G_debug(3, " n_isles = %d", Area->n_isles);
return (Area->n_isles);
}
/*!
\brief Returns isle for area
\param Map vector map
\param area area id
\param isle isle id
\return isles for area
\return 0 if no isle found
*/
int Vect_get_area_isle(struct Map_info *Map, int area, int isle)
{
struct Plus_head *Plus;
P_AREA *Area;
G_debug(3, "Vect_get_area_isle(): area = %d isle = %d", area, isle);
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL)
G_fatal_error(_("Attempt to read topo for dead area (%d)"), area);
G_debug(3, " -> isle = %d", Area->isles[isle]);
return (Area->isles[isle]);
}
/*!
\brief Returns area for isle
\param Map vector
\param isle island number
\return area id
\return 0 area not found
*/
int Vect_get_isle_area(struct Map_info *Map, int isle)
{
struct Plus_head *Plus;
P_ISLE *Isle;
G_debug(3, "Vect_get_isle_area(): isle = %d", isle);
Plus = &(Map->plus);
Isle = Plus->Isle[isle];
if (Isle == NULL)
G_fatal_error(_("Attempt to read topo for dead isle (%d)"), isle);
G_debug(3, " -> area = %d", Isle->area);
return (Isle->area);
}
/*!
\brief Calculate area perimeter
\param Points list of points defining area boundary
\return area perimeter
*/
double Vect_area_perimeter(struct line_pnts *Points)
{
return Vect_line_length(Points);
}
/*!
\brief Returns 1 if point is in area
\param Map vector map
\param area area id
\param x,y point coordinates
\return 1 if point is in area
\return 0 if not
*/
int Vect_point_in_area(struct Map_info *Map, int area, double x, double y)
{
int i, isle;
struct Plus_head *Plus;
P_AREA *Area;
int poly;
Plus = &(Map->plus);
Area = Plus->Area[area];
if (Area == NULL)
return 0;
poly = Vect_point_in_area_outer_ring(x, y, Map, area);
if (poly == 0)
return 0; /* includes area boundary (poly == 2), OK? */
/* check if in islands */
for (i = 0; i < Area->n_isles; i++) {
isle = Area->isles[i];
poly = Vect_point_in_island(x, y, Map, isle);
if (poly >= 1)
return 0; /* excludes island boundary (poly == 2), OK? */
}
return 1;
}
/*!
\brief Returns area of area without areas of isles
\param Map vector map
\param area area id
\return area of area without areas of isles
*/
double Vect_get_area_area(struct Map_info *Map, int area)
{
struct Plus_head *Plus;
P_AREA *Area;
struct line_pnts *Points;
double size;
int i;
static int first_time = 1;
G_debug(3, "Vect_get_area_area(): area = %d", area);
if (first_time == 1) {
G_begin_polygon_area_calculations();
first_time = 0;
}
Points = Vect_new_line_struct();
Plus = &(Map->plus);
Area = Plus->Area[area];
Vect_get_area_points(Map, area, Points);
size = G_area_of_polygon(Points->x, Points->y, Points->n_points);
/* substructing island areas */
for (i = 0; i < Area->n_isles; i++) {
Vect_get_isle_points(Map, Area->isles[i], Points);
size -= G_area_of_polygon(Points->x, Points->y, Points->n_points);
}
Vect_destroy_line_struct(Points);
G_debug(3, " area = %f", size);
return (size);
}
/*!
\brief Get area categories
\param Map vector map
\param area area id
\param[out] Cats list of categories
\return 0 OK centroid found (but may be without categories)
\return 1 no centroid found
*/
int Vect_get_area_cats(struct Map_info *Map, int area, struct line_cats *Cats)
{
int centroid;
Vect_reset_cats(Cats);
centroid = Vect_get_area_centroid(Map, area);
if (centroid > 0) {
Vect_read_line(Map, NULL, Cats, centroid);
}
else {
return 1; /* no centroid */
}
return 0;
}
/*!
\brief Find FIRST category of given field and area
\param Map vector map
\param area area id
\param field layer number
\return first found category of given field
\return -1 no centroid or no category found
*/
int Vect_get_area_cat(struct Map_info *Map, int area, int field)
{
int i;
static struct line_cats *Cats = NULL;
if (!Cats)
Cats = Vect_new_cats_struct();
else
Vect_reset_cats(Cats);
if (Vect_get_area_cats(Map, area, Cats) == 1 || Cats->n_cats == 0) {
return -1;
}
for (i = 0; i < Cats->n_cats; i++) {
if (Cats->field[i] == field) {
return Cats->cat[i];
}
}
return -1;
}
|