开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
捐赠
捐赠前请先登录
扫描微信二维码支付
取消
支付完成
支付提示
将跳转至支付宝完成支付
确定
取消
1 Star 0 Fork 136

xiaodingding/AForge.NET

forked from 海洋饼干/AForge.NET
加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
master
分支 (1)
master
master
分支 (1)
master
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
master
分支 (1)
master
AForge.NET
/
Sources
/
Math
/
Geometry
/
LineSegment.cs
AForge.NET
/
Sources
/
Math
/
Geometry
/
LineSegment.cs
LineSegment.cs 14.72 KB
一键复制 编辑 原始数据 按行查看 历史
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372
// AForge Math Library
// AForge.NET framework
// http://www.aforgenet.com/framework/
//
// Copyright AForge.NET, 2007-2011
// contacts@aforgenet.com
//
namespace AForge.Math.Geometry
{
using System;
/// <summary>
/// The class encapsulates 2D line segment and provides some tool methods related to lines.
/// </summary>
///
/// <remarks><para>The class provides some methods which are related to line segments:
/// distance to point, finding intersection point, etc.
/// </para>
///
/// <para>A line segment may be converted to a <see cref="Line"/>.</para>
///
/// <para>Sample usage:</para>
/// <code>
/// // create a segment
/// LineSegment segment = new LineSegment( new Point( 0, 0 ), new Point( 3, 4 ) );
/// // get segment's length
/// float length = segment.Length;
///
/// // get intersection point with a line
/// Point? intersection = segment.GetIntersectionWith(
/// new Line( new Point( -3, 8 ), new Point( 0, 4 ) ) );
/// </code>
/// </remarks>
///
public sealed class LineSegment
{
// segment's start/end point
private readonly Point start;
private readonly Point end;
private readonly Line line;
/// <summary>
/// Start point of the line segment.
/// </summary>
public Point Start
{
get { return start; }
}
/// <summary>
/// End point of the line segment.
/// </summary>
public Point End
{
get { return end; }
}
/// <summary>
/// Get segment's length - Euclidean distance between its <see cref="Start"/> and <see cref="End"/> points.
/// </summary>
public float Length
{
get { return start.DistanceTo( end ); }
}
/// <summary>
/// Initializes a new instance of the <see cref="LineSegment"/> class.
/// </summary>
///
/// <param name="start">Segment's start point.</param>
/// <param name="end">Segment's end point.</param>
///
/// <exception cref="ArgumentException">Thrown if the two points are the same.</exception>
///
public LineSegment( Point start, Point end )
{
line = Line.FromPoints( start, end );
this.start = start;
this.end = end;
}
/// <summary>
/// Converts this <see cref="LineSegment"/> to a <see cref="Line"/> by discarding
/// its endpoints and extending it infinitely in both directions.
/// </summary>
///
/// <param name="segment">The segment to convert to a <see cref="Line"/>.</param>
///
/// <returns>Returns a <see cref="Line"/> that contains this <paramref name="segment"/>.</returns>
///
public static explicit operator Line( LineSegment segment )
{
return segment.line;
}
/// <summary>
/// Calculate Euclidean distance between a point and a finite line segment.
/// </summary>
///
/// <param name="point">The point to calculate the distance to.</param>
///
/// <returns>Returns the Euclidean distance between this line segment and the specified point. Unlike
/// <see cref="Line.DistanceToPoint"/>, this returns the distance from the finite segment. (0,0) is 5 units
/// from the segment (0,5)-(0,8), but is 0 units from the line through those points.</returns>
///
public float DistanceToPoint( Point point )
{
float segmentDistance;
switch ( LocateProjection( point ) )
{
case ProjectionLocation.RayA:
segmentDistance = point.DistanceTo( start );
break;
case ProjectionLocation.RayB:
segmentDistance = point.DistanceTo( end );
break;
default:
segmentDistance = line.DistanceToPoint( point );
break;
};
return segmentDistance;
}
/// <summary>
/// Finds, provided it exists, the intersection point with the specified <see cref="LineSegment"/>.
/// </summary>
///
/// <param name="other"><see cref="LineSegment"/> to find intersection with.</param>
///
/// <returns>Returns intersection point with the specified <see cref="LineSegment"/>, or <see langword="null"/>, if
/// the two segments do not intersect.</returns>
///
/// <remarks><para>If the two segments do not intersect, the method returns <see langword="null"/>. If the two
/// segments share multiple points, this throws an <see cref="InvalidOperationException"/>.
/// </para></remarks>
///
/// <exception cref="InvalidOperationException">Thrown if the segments overlap - if they have
/// multiple points in common.</exception>
///
public Point? GetIntersectionWith( LineSegment other )
{
Point? result = null;
if ( ( line.Slope == other.line.Slope ) || ( line.IsVertical && other.line.IsVertical ) )
{
if ( line.Intercept == other.line.Intercept )
{
// Collinear segments. Inspect and handle.
// Consider this segment AB and other as CD. (start/end in both cases)
// There are three cases:
// 0 shared points: C and D both project onto the same ray of AB
// 1 shared point: One of A or B equals one of C or D, and the other of C/D
// projects on the correct ray.
// Many shared points.
ProjectionLocation projC = LocateProjection( other.start ), projD = LocateProjection( other.end );
if ( ( projC != ProjectionLocation.SegmentAB ) && ( projC == projD ) )
{
// no shared points
result = null;
}
else if ( ( ( start == other.start ) && ( projD == ProjectionLocation.RayA ) ) ||
( ( start == other.end ) && ( projC == ProjectionLocation.RayA ) ) )
{
// shared start point
result = start;
}
else if ( ( ( end == other.start ) && ( projD == ProjectionLocation.RayB ) ) ||
( ( end == other.end ) && ( projC == ProjectionLocation.RayB ) ) )
{
// shared end point
result = end;
}
else
{
// overlapping
throw new InvalidOperationException( "Overlapping segments do not have a single intersection point." );
}
}
}
else
{
result = GetIntersectionWith( other.line );
if ( ( result.HasValue ) && ( other.LocateProjection( result.Value ) != ProjectionLocation.SegmentAB ) )
{
// the intersection is on the extended line of this segment
result = null;
}
}
return result;
}
/// <summary>
/// Finds, provided it exists, the intersection point with the specified <see cref="Line"/>.
/// </summary>
///
/// <param name="other"><see cref="Line"/> to find intersection with.</param>
///
/// <returns>Returns intersection point with the specified <see cref="Line"/>, or <see langword="null"/>, if
/// the line does not intersect with this segment.</returns>
///
/// <remarks><para>If the line and the segment do not intersect, the method returns <see langword="null"/>. If the line
/// and the segment share multiple points, the method throws an <see cref="InvalidOperationException"/>.
/// </para></remarks>
///
/// <exception cref="InvalidOperationException">Thrown if this segment is a portion of
/// <paramref name="other"/> line.</exception>
///
public Point? GetIntersectionWith( Line other )
{
Point? result;
if ( ( line.Slope == other.Slope ) || ( line.IsVertical && other.IsVertical ) )
{
if ( line.Intercept == other.Intercept ) throw new InvalidOperationException( "Segment is a portion of the specified line." );
// unlike Line.GetIntersectionWith(Line), this does not throw on parallel distinct lines
result = null;
}
else
{
result = line.GetIntersectionWith( other );
}
if ( ( result.HasValue ) && ( LocateProjection( result.Value ) != ProjectionLocation.SegmentAB ) )
{
// the intersection is on this segment's extended line, but not on the segment itself
result = null;
}
return result;
}
// Represents the location of a projection of a point on the line that contains this segment.
// If the point projects to A,B, or anything between them, it is SegmentAB.
// If it projects beyond A, it's RayA; if it projects beyond B, it's RayB.
private enum ProjectionLocation { RayA, SegmentAB, RayB }
// Get type of point's projections to this line segment
private ProjectionLocation LocateProjection( Point point )
{
// Modified from http://www.codeguru.com/forum/showthread.php?t=194400
/* How do I find the distance from a point to a line segment?
Let the point be C (Cx,Cy) and the line be AB (Ax,Ay) to (Bx,By).
Let P be the point of perpendicular projection of C on AB. The parameter
r, which indicates P's position along AB, is computed by the dot product
of AC and AB divided by the square of the length of AB:
(1) AC dot AB
r = ---------
||AB||^2
r has the following meaning:
r=0 P = A
r=1 P = B
r<0 P is on the backward extension of AB (and distance C-AB is distance C-A)
r>1 P is on the forward extension of AB (and distance C-AB is distance C-B)
0<r<1 P is interior to AB (and distance C-AB(segment) is distance C-AB(line))
The length of the line segment AB is computed by:
L = sqrt( (Bx-Ax)^2 + (By-Ay)^2 )
and the dot product of two 2D vectors, U dot V, is computed:
D = (Ux * Vx) + (Uy * Vy)
So (1) expands to:
(Cx-Ax)(Bx-Ax) + (Cy-Ay)(By-Ay)
r = -------------------------------
(Bx-Ax)^2 + (By-Ay)^2
*/
// the above is modified here to compare the numerator and denominator, rather than doing the division
Point abDelta = end - start;
Point acDelta = point - start;
float numerator = acDelta.X * abDelta.X + acDelta.Y * abDelta.Y;
float denomenator = abDelta.X * abDelta.X + abDelta.Y * abDelta.Y;
ProjectionLocation result = ( numerator < 0 ) ? ProjectionLocation.RayA : ( numerator > denomenator ) ? ProjectionLocation.RayB : ProjectionLocation.SegmentAB;
return result;
}
/// <summary>
/// Equality operator - checks if two line segments have equal parameters.
/// </summary>
///
/// <param name="line1">First line segment to check.</param>
/// <param name="line2">Second line segment to check.</param>
///
/// <returns>Returns <see langword="true"/> if parameters of specified
/// line segments are equal.</returns>
///
public static bool operator ==( LineSegment line1, LineSegment line2 )
{
if ( System.Object.ReferenceEquals( line1, line2 ) )
{
return true;
}
if ( ( (object) line1 == null ) || ( (object) line2 == null ) )
{
return false;
}
return ( ( line1.start == line2.start ) && ( line1.end == line2.end ) );
}
/// <summary>
/// Inequality operator - checks if two lines have different parameters.
/// </summary>
///
/// <param name="line1">First line segment to check.</param>
/// <param name="line2">Second line segment to check.</param>
///
/// <returns>Returns <see langword="true"/> if parameters of specified
/// line segments are not equal.</returns>
///
public static bool operator !=( LineSegment line1, LineSegment line2 )
{
return !( line1 == line2 );
}
/// <summary>
/// Check if this instance of <see cref="LineSegment"/> equals to the specified one.
/// </summary>
///
/// <param name="obj">Another line segment to check equalty to.</param>
///
/// <returns>Return <see langword="true"/> if objects are equal.</returns>
///
public override bool Equals( object obj )
{
return ( obj is LineSegment ) ? ( this == (LineSegment) obj ) : false;
}
/// <summary>
/// Get hash code for this instance.
/// </summary>
///
/// <returns>Returns the hash code for this instance.</returns>
///
public override int GetHashCode( )
{
return start.GetHashCode( ) + end.GetHashCode( );
}
/// <summary>
/// Get string representation of the class.
/// </summary>
///
/// <returns>Returns string, which contains values of the like in readable form.</returns>
///
public override string ToString( )
{
return string.Format( System.Globalization.CultureInfo.InvariantCulture, "({0}) -> ({1})", start, end );
}
}
}
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

简介

AForge.NET 是一个专门为开发者和研究者基于C#框架设计的,他包括计算机视觉与人工智能,图像处理,神经网络,遗传算法,机器学习,机器人等领域。这个框架由一系列 的类库和例子组成。
取消

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/xiaodingding/AForge.NET.git
git@gitee.com:xiaodingding/AForge.NET.git
xiaodingding
AForge.NET
AForge.NET
master
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /