-
Notifications
You must be signed in to change notification settings - Fork 1.3k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
How to draw the SVG path from the path array returned by the algorithm? #204
Comments
Hi Arun, The returned path is a list of coordinates in a 2D-Array representing a map. If you like to visualize that as SVG-path you have to calculate the positions based on your cell size. I think easiest would be to use a SVG-Polyline to represent it as line. If you like to use SVG Andreas |
Instead of poly line which which makes the attribute lengthy, I was thinking it's better to indentify the bends in the path aray and convert them into a few |
Hi Arun, |
If I serialize and save It might need more memory. Also I created small circles using the path array. But it created a random path as opposed to smoother horizontal and vertical lines. Here is the configuration:
and code to create the circles to trace the path
|
@arunkumar413 you can research how it's implemented in react-flow. In the past I created my own react-flow edge implementation which use PathFinding.js to calculate the path |
@killmenot I'd like to create my own as well but I'm not understanding why it created a random path instead of a Manhattan path. Here what does the cell size refer to? I'm using svg and dimensions are in pixels only. |
I have isolated the issue for you here: https://stackblitz.com/edit/react-febp9q?file=src%2FApp.js I also used the |
It's working as expected if I apply the weight other than 1
|
Hello Team,
The path array returned by pathfinder is lengthy. Could you please guide me on how to draw the svg path and also for converting the array into svg path's
H
andV
commands.Thanks,
Arun
The text was updated successfully, but these errors were encountered: