Question

In the application I am developing I have polygons as show in the picture

My data structure is double-linked list as follows.

RzCurve {
   RzNode *head;
};


RzNode{
      double x;
      double y;
      RzNode *next;
      RzNode *prev;
}

I want to implement an algorithm which allows user to add a new Node by clicking mouse.

Any tips on this?

Regards,
umanga

Answer 1

I would probably go through all line segments, calculate the distance of the point to the line segment, and insert the point between the end points of the line segment with the shortest distance to the new point. Further I would only consider line segments where the line through the new point and perpendicular to the line through the end points of the line segment intersects the line segment.