Fast and Robust Curve Intersections

Computes intersection points of two curves.

이 제출물을 팔로우합니다

편집자 메모: This file was selected as MATLAB Central Pick of the Week

This function computes the (x,y) locations where two curves intersect. The curves can be broken with NaNs or have vertical segments. It is also very fast (at least on data that represents what I think is a typical application).

인용 양식

Douglas Schwarz (2026). Fast and Robust Curve Intersections (https://kr.mathworks.com/matlabcentral/fileexchange/11837-fast-and-robust-curve-intersections), MATLAB Central File Exchange. 검색 날짜: .

카테고리

Help CenterMATLAB Answers에서 Fit Postprocessing에 대해 자세히 알아보기

일반 정보

MATLAB 릴리스 호환 정보

  • 모든 릴리스와 호환

플랫폼 호환성

  • Windows
  • macOS
  • Linux
버전 퍼블리시됨 릴리스 정보 Action
3.0.0.0

I just learned about the paged matrix functions from Mike Croucher's blog and immediately replaced backslash with pagemldivide for a significant speedup.

2.0.0.0

This version uses implicit expansion (or bsxfun in slightly older MATLAB versions) to compute the line segments that might overlap. When the number of line segments is large, it uses a different algorithm to avoid forming large matrices.

1.2.0.0

Fixed bug that my previous "bug fix" failed to fix.

1.1.0.0

Fixed bug identified by Rodrigo Portugal. No longer fails when there are no intersections and you need 4 outputs.

1.0.0.0

Added ability to find self-intersections of one curve.