[GRASS5] anyone use/need fragstats?

John Gillette JGillette at rfmd.com
Wed Jun 18 12:47:39 EDT 2003

I have a question about:

> v.patch input=a,b output=c1
> v.clean input=c1 output=c2 tool=break,rmdupl

Given:                 ___
  _________           |   |
 |         |          |   |
 | A       |          |   |
 |_________|          | B |
                      |   |

patch A,B gives:
    |  |   |  |
    | A|   |  |    ?
       | B |

There are 4 intersections and 5 areas created
by the patch operation in this example. What does
"v.clean input=c1 output=c2 tool=break,rmdupl"
do to patch's result?

I am interested in a v.mapcalc that would do A union B,
A intersection B, A-B, B-A, as well as Booleans like
is_simple(A), is_convex(A).  Are there library functions
for doing such things in 5.1? I suspect that we are not 
quite there yet? 

Actually, I am more interested in having the library functions
than having v.mapcalc.

Could you tell me what you are working on with respect 
to these kinds of problems and what your plans are?

Ref: general polygon clipper library (gpc)

     CGAL, the Computational Geometry Algorithms Library
     CGAL Basic Library Manuals, Polygon Operations


More information about the grass-dev mailing list