by Thang Minh Vu
Demo: To easier understand the idea, you can check a demo version at the demo page.
- A base point (B)
- Current mouse position (M)
- Projection of current mouse position on x-axis or y-axis (P)
For convenience, in all graphs, we will mark the base point by a red circle and the current mouse point by a green circle.
As I tackle the problem, it’s intuitive to see we can calculate the distance between the current mouse position with the horizontal line and vertical line. If the mouse position is nearer the horizontal line than the vertical line, we will take the projection on the horizontal line, and vice versa.
How about if we want to project on the bisector line between the horizontal line and vertical line (similar with Sketch)? That means users can project the mouse position on the horizontal line, vertical line, 45-degree angle line, or 135-degree angle line.
The approach is similar. This time we need to calculate the distance between the mouse position to 4 lines: horizontal line, vertical line, and 2 bisector lines (45-degree line and 135-degree line). But the calculation is more complex.
We still can divide it into 2 steps:
- Determine which line is nearest with mouse position
- Calculate the projection of mouse position on the nearest line
Step 1: Determine which line is nearest with mouse position
First, we need to determine line formulation of 4 lines above. Because we already know the base point (x0, y0) and the line angle, it’s easy to figure out the formulation of each line.
Example: To calculate the formula of the 45-degree bisector, we already know that the line will go through the base point (x0, y0) and (x0 + 1, y0 + 1). Using the Find-the-Equation-of-a-Line method, we can figure out the line formula.
Finally, we will have 4 lines’ formulas:
To calculate the distance between the base mouse position to each line, we can use a popular math formula:
Step 2: Calculate the orthogonal projection of mouse position on the nearest line
Now the problem becomes calculating the orthogonal projection of the mouse position (M) to the nearest line with the formula: ax + by + c = 0 (L)
There are multiple ways to solve this problem. I took a simple way: First, calculate the formula of the line which contains mouse position M and perpendicular to line L, called L'. Then, solve the system of equations to get the intersection point between line L and L', which is the projection point which we are finding.
After some calculation, I figured out the formula of L’, which goes through M (x0, y0) and perpendicular to L (ax + by + c = 0):
Now to find the intersection, we need to solve the system of equations:
Using Cramer’s rule and matrix determinant, we can solve this equation easily:
There is a situation when we want to limit the boundary of projection.
In this case, we want to limit the projection in the white rectangle area, but using the discussed method, the projection point can be outside of the boundary area.
In this situation, we can simply get the intersection point of line L’ to the boundary (called P’).
Full source code
You can check out the demo and source code on Github.