开发者

How to tell in C# whether GPS shapes intersect?

开发者 https://www.devze.com 2023-03-19 16:07 出处:网络
If I have two WTK (well known text) shapes in C# how can I tell if these intersect? For instance are there any libraries, or are there any standard alg开发者_运维知识库orithms?

If I have two WTK (well known text) shapes in C# how can I tell if these intersect?

For instance are there any libraries, or are there any standard alg开发者_运维知识库orithms?

I might also need to do this using a group of points like this for each shape,

    public double[] Eastings { get; set; }
    public double[] Northings { get; set; }


Sounds like you want the .NET topology suite, which implements WKT parsing and full topology operations such as Intersect and Overlaps tests. I haven't actually used the .NET version, but I've used its predecessor the Java Topology Suite (JTS) and it's worked very well for me.

0

精彩评论

暂无评论...
验证码 换一张
取 消