Skip to content

Conversation

@tsrivishnu
Copy link
Collaborator

No description provided.

* Identify possible parallel lines by determining if 1/4th of points of
the line are below a predefined distance.

* Getting farthest points from a list of points has been very slow when
there are a lot of points. Improved it by using generating a ConvexHull
and using it for distance.

* Skip inferring cluster if there is only one point.
variable to be set to True to consider angle of deviation.
NodesWrapper calculates the angles of deviation for those points that
are within a distance (a separate variable to be used just when angles
are requested).
We ceil the angle to a closest multiple of 5 and also round up the
distance to 3 decimal points. This way, we will sort based on the
angle and then by distance.
Polygon in sense, a powerstation (substation etc.)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants