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.

Sign up for GitHub

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

Jump to bottom

求点到多边形的距离的算法实现 - jingsam #55

Open

utterances-bot opened this issue Sep 24, 2021 · 3 comments

utterances-bot commented Sep 24, 2021

求点到多边形的距离的算法实现 - jingsam

求点到多边形的距离的算法实现

https://jingsam.github.io/2016/09/26/polydist.html

lagXkjy commented Sep 24, 2021

怎么凭空冒出了个j

Owner

jingsam commented Sep 25, 2021

应该是i + 1

kiulangvin commented Jun 13, 2022

if ((a[1] > y !== b[1] > y) ，x，y 从哪冒出来的

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment