geoos icon indicating copy to clipboard operation
geoos copied to clipboard

A library provides spatial data and geometric algorithms

Results 22 geoos issues
Sort by recently updated
recently updated
newest added

We will implement an approach to rotatable geometry with parameters that support 360 degree rotation and the addition of rotatable anchor points. Thanks for your support 🙏

We will add a partial method for modifying spatial geometry, this time adding a method to convert non-closed polygon to closed loop to help you build standard spatial polygon.

When I used the method to check the validity of space, I entered polygon data with duplicate point positions and returned false. And I think it should return true.

We will add a new vector geometry method: The Tyson polygon Method introduction: A Tyson polygon is a partition of a spatial plane. It is characterized by the fact that...

``` const d = `{"type":"LineString","coordinates":[[148.3,23.9],[149.3,25],[149.5,25.3],[149.5,25.3],[149.5,25.3],[149.9,26.1],[150.2,26.4],[150.5,27.1],[150.5,27.1],[150.8,28.8],[150.8,28.8],[150.9,29.2],[150.7,29.7],[150.8,30.1],[150.6,30.4],[150.4,30.6],[150.1,31.6],[149.8,32.5]]}` g, _ := geoencoding.Decode([]byte(d), geoencoding.GeoJSON) b := g.BufferInMeter(100, calc.QuadrantSegments) fmt.Println(string(geoencoding.Encode(b, geoencoding.WKT))) ``` 返回结果中存在很多NaN,返回结果如下: ``` POLYGON((149.29921586139045 25.000588113059923,NaN NaN,149.4990720118337 25.30037798677464,149.89907201183368 26.100375455240716,149.89914706649813 26.100498760295352,149.899242 28147618 26.100610276338013,150.19924228147616 26.40060870255267,NaN NaN,150.4989943229493 27.100139551904082,NaN...

Hello, and thank you for this project! Is it possible to calculate the spatial intersection of two geometries? Say, the point where two lines intersect? I wasn't able to find...

I see that you have chosen to release your library using the LGPL license. I am not a lawyer and nothing in this text is legal advice, but my understanding...

Using DP geometry simplification I noted that the shadow method tranformCollection() in Tranformer obscure the call at a missing method in DPTransformer and the call at space.Geometry.Simplify() doesn't work in...

Add ConvexHull() method to clusters.PointList and clusters.Cluster types. Add unit test for PointList.ConvexHull(). Implementation of Andrew's Monotone Chain algorithm (O(n log n) complexity with n = number of points). closes...

Is there any initiative to implement a function to calculate the ConvexHull for a list of Points (and specifically: for clusters) ?