There is an array of orthogonal segments; each segment is represented by points P1, P2; segments are connected to each other, i.e. points P1 and P2 intersect with other points P1 and P2 of other segments. It turns out a picture like the following Example 1

Accordingly, the user can drag these segments and points of corners and joints. The segment point that ends in red is considered fixed; it can only move if the user moves the red square.

As in such cases, the limitations of moving points are described as well as the connections between segments so that, for example, moving the lower right corner moves the segments connected with it.

  • What solutions have you tried? - 0xdb
  • one
    I just wanted to know where to dig, because on the one hand, the task is rather complicated to solve it from scratch, on the other hand, the problem solved many times already, at least some keywords - Json
  • You can search by tags - type in “Search” - [label] [label] - 0xdb
  • one
    What exactly to type to find a similar question? And I know how to use the search thanks - Json

0