c*t
2 楼
easy. There is a scan line method.
Basically, let a horizontal line (or any arbitrary line, but horizontal
is easier computationally) go through the point. Then count the # of
interceptions of the curves on this line. If the point is inside the
curves, then the # of interceptions to the left of the point should be
odd.
,
【在 x*********l 的大作中提到】
: 请教大家一个算法的问题。在一个图像里有很多互相不相交的封闭曲线(任意形状),
: 如何判断任意一个点是在这些封闭曲线内,还是在曲线外?
Basically, let a horizontal line (or any arbitrary line, but horizontal
is easier computationally) go through the point. Then count the # of
interceptions of the curves on this line. If the point is inside the
curves, then the # of interceptions to the left of the point should be
odd.
,
【在 x*********l 的大作中提到】
: 请教大家一个算法的问题。在一个图像里有很多互相不相交的封闭曲线(任意形状),
: 如何判断任意一个点是在这些封闭曲线内,还是在曲线外?
x*l
4 楼
3x
【在 c*****t 的大作中提到】
: easy. There is a scan line method.
: Basically, let a horizontal line (or any arbitrary line, but horizontal
: is easier computationally) go through the point. Then count the # of
: interceptions of the curves on this line. If the point is inside the
: curves, then the # of interceptions to the left of the point should be
: odd.
:
: ,
【在 c*****t 的大作中提到】
: easy. There is a scan line method.
: Basically, let a horizontal line (or any arbitrary line, but horizontal
: is easier computationally) go through the point. Then count the # of
: interceptions of the curves on this line. If the point is inside the
: curves, then the # of interceptions to the left of the point should be
: odd.
:
: ,
l*u
5 楼
Sounds good. The only thing is that one needs to be careful in determining
if the line is intersecting, not just tangent, with the curve.
【在 c*****t 的大作中提到】
: easy. There is a scan line method.
: Basically, let a horizontal line (or any arbitrary line, but horizontal
: is easier computationally) go through the point. Then count the # of
: interceptions of the curves on this line. If the point is inside the
: curves, then the # of interceptions to the left of the point should be
: odd.
:
: ,
if the line is intersecting, not just tangent, with the curve.
【在 c*****t 的大作中提到】
: easy. There is a scan line method.
: Basically, let a horizontal line (or any arbitrary line, but horizontal
: is easier computationally) go through the point. Then count the # of
: interceptions of the curves on this line. If the point is inside the
: curves, then the # of interceptions to the left of the point should be
: odd.
:
: ,
相关阅读
珍爱生命,远离Nodejs?京东有了云平台了有什么可以取代win的textpad吗? (转载)量子计算机搞出来后, 是不是docker一上台面宣传瞬间被揭出安全漏洞看到越来越多的公司从.NET转Node了工厂模式 (转载)python转化成exe的能力怎样?转行困惑求解:关于JavaScript和职业发展本人开发的新ios游戏视频,求反馈 (转载)javascript custome event是不是IE不支持?熟悉C++,向Windows 还是Linux 方向发展? thanksfpga工作机会多么?想从码农往fpga转,靠谱不哪里有便宜的hadoop计算平台vps 请教寻找一个allocator 做一个指定内存空间内的 alloc/freeForward declaration with unique_ptrhaskell 真是逆天, 各种特殊符号都有特殊用途c++如果调用没参数的函数不用加()就好了python和C#如何融合进行数据交换