mirror of
https://gitlab.com/kicad/code/kicad.git
synced 2025-09-14 10:13:19 +02:00
uncrustify math_for_graphics, add copyright legacy_plugin.h
This commit is contained in:
Dick Hollenbeck
parent
597833b55e
commit
72d4b2353b
@ -150,12 +150,10 @@ bool BASE_SCREEN::SetZoom( double coeff )
|
||||
|
||||
bool BASE_SCREEN::SetNextZoom()
|
||||
{
|
||||
size_t i;
|
||||
|
||||
if( m_ZoomList.IsEmpty() || m_Zoom >= m_ZoomList.Last() )
|
||||
return false;
|
||||
|
||||
for( i = 0; i < m_ZoomList.GetCount(); i++ )
|
||||
for( unsigned i = 0; i < m_ZoomList.GetCount(); i++ )
|
||||
{
|
||||
if( m_Zoom < m_ZoomList[i] )
|
||||
{
|
||||
|
||||
@ -4,7 +4,8 @@
|
||||
/*
|
||||
* This program source code file is part of KiCad, a free EDA CAD application.
|
||||
*
|
||||
* Copyright (C) 1992-2011 KiCad Developers, see change_log.txt for contributors.
|
||||
* Copyright (C) 2012 SoftPLC Corporation, Dick Hollenbeck <dick@softplc.com>
|
||||
* Copyright (C) 2012 KiCad Developers, see change_log.txt for contributors.
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or
|
||||
* modify it under the terms of the GNU General Public License
|
||||
@ -59,8 +60,6 @@ struct FPL_CACHE;
|
||||
*/
|
||||
class LEGACY_PLUGIN : public PLUGIN
|
||||
{
|
||||
friend struct FPL_CACHE;
|
||||
|
||||
public:
|
||||
|
||||
//-----<PLUGIN IMPLEMENTATION>----------------------------------------------
|
||||
@ -272,6 +271,8 @@ protected:
|
||||
|
||||
/// we only cache one footprint library for now, this determines which one.
|
||||
void cacheLib( const wxString& aLibraryPath );
|
||||
|
||||
friend struct FPL_CACHE;
|
||||
};
|
||||
|
||||
#endif // LEGACY_PLUGIN_H_
|
||||
|
||||
@ -30,6 +30,7 @@ bool TestLineHit( int xi, int yi, int xf, int yf, int x, int y, double dist )
|
||||
{
|
||||
// vertical segment
|
||||
dd = fabs( (double) (x - xi) );
|
||||
|
||||
if( dd<dist && ( (yf>yi && y<yf && y>yi) || (yf<yi && y>yf && y<yi) ) )
|
||||
return true;
|
||||
}
|
||||
@ -37,6 +38,7 @@ bool TestLineHit( int xi, int yi, int xf, int yf, int x, int y, double dist )
|
||||
{
|
||||
// horizontal segment
|
||||
dd = fabs( (double) (y - yi) );
|
||||
|
||||
if( dd<dist && ( (xf>xi && x<xf && x>xi) || (xf<xi && x>xf && x<xi) ) )
|
||||
return true;
|
||||
}
|
||||
@ -54,6 +56,7 @@ bool TestLineHit( int xi, int yi, int xf, int yf, int x, int y, double dist )
|
||||
double yp = a + b * xp;
|
||||
// find distance
|
||||
dd = sqrt( (x - xp) * (x - xp) + (y - yp) * (y - yp) );
|
||||
|
||||
if( fabs( b )>0.7 )
|
||||
{
|
||||
// line segment more vertical than horizontal
|
||||
@ -67,6 +70,7 @@ bool TestLineHit( int xi, int yi, int xf, int yf, int x, int y, double dist )
|
||||
return true;
|
||||
}
|
||||
}
|
||||
|
||||
return false; // no hit
|
||||
}
|
||||
|
||||
@ -78,6 +82,7 @@ int MakeEllipseFromArc( int xi, int yi, int xf, int yf, int style, EllipseKH * e
|
||||
// arc (quadrant of ellipse)
|
||||
// convert to clockwise arc
|
||||
int xxi, xxf, yyi, yyf;
|
||||
|
||||
if( style == CPolyLine::ARC_CCW )
|
||||
{
|
||||
xxi = xf;
|
||||
@ -92,8 +97,10 @@ int MakeEllipseFromArc( int xi, int yi, int xf, int yf, int style, EllipseKH * e
|
||||
yyi = yi;
|
||||
yyf = yf;
|
||||
}
|
||||
|
||||
// find center and radii of ellipse
|
||||
double xo = 0, yo = 0;
|
||||
|
||||
if( xxf > xxi && yyf > yyi )
|
||||
{
|
||||
xo = xxf;
|
||||
@ -122,6 +129,7 @@ int MakeEllipseFromArc( int xi, int yi, int xf, int yf, int style, EllipseKH * e
|
||||
el->theta1 = M_PI / 2.0;
|
||||
el->theta2 = 0.0;
|
||||
}
|
||||
|
||||
el->Center.X = xo;
|
||||
el->Center.Y = yo;
|
||||
el->xrad = abs( xf - xi );
|
||||
@ -130,16 +138,19 @@ int MakeEllipseFromArc( int xi, int yi, int xf, int yf, int style, EllipseKH * e
|
||||
el->Phi = 0.0;
|
||||
el->MaxRad = el->xrad;
|
||||
el->MinRad = el->yrad;
|
||||
|
||||
if( el->MaxRad < el->MinRad )
|
||||
{
|
||||
el->MaxRad = el->yrad;
|
||||
el->MinRad = el->xrad;
|
||||
el->Phi = M_PI / 2.0;
|
||||
}
|
||||
|
||||
#endif
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
// find intersections between line segment (xi,yi) to (xf,yf)
|
||||
// and line segment (xi2,yi2) to (xf2,yf2)
|
||||
// the line segments may be arcs (i.e. quadrant of an ellipse) or straight
|
||||
@ -169,6 +180,7 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
x[0] = xi;
|
||||
y[0] = yi;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
else if( style != style2 && xi == xf2 && yi == yf2 && xf == xi2 && yf == yi2 )
|
||||
@ -178,6 +190,7 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
x[0] = xi;
|
||||
y[0] = yi;
|
||||
}
|
||||
|
||||
return 1;
|
||||
}
|
||||
}
|
||||
@ -186,9 +199,20 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
{
|
||||
// both straight-line segments
|
||||
int x, y;
|
||||
bool bYes = TestForIntersectionOfStraightLineSegments( xi, yi, xf, yf, xi2, yi2, xf2, yf2, &x, &y );
|
||||
bool bYes = TestForIntersectionOfStraightLineSegments( xi,
|
||||
yi,
|
||||
xf,
|
||||
yf,
|
||||
xi2,
|
||||
yi2,
|
||||
xf2,
|
||||
yf2,
|
||||
&x,
|
||||
&y );
|
||||
|
||||
if( !bYes )
|
||||
return 0;
|
||||
|
||||
xr[0] = x;
|
||||
yr[0] = y;
|
||||
iret = 1;
|
||||
@ -198,6 +222,7 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
// first segment is straight, second segment is an arc
|
||||
int ret;
|
||||
double x1r, y1r, x2r, y2r;
|
||||
|
||||
if( xf == xi )
|
||||
{
|
||||
// vertical first segment
|
||||
@ -213,14 +238,17 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
ret = FindLineSegmentIntersection( a, b, xi2, yi2, xf2, yf2, style2,
|
||||
&x1r, &y1r, &x2r, &y2r );
|
||||
}
|
||||
|
||||
if( ret == 0 )
|
||||
return 0;
|
||||
|
||||
if( InRange( x1r, xi, xf ) && InRange( y1r, yi, yf ) )
|
||||
{
|
||||
xr[iret] = x1r;
|
||||
yr[iret] = y1r;
|
||||
iret++;
|
||||
}
|
||||
|
||||
if( ret == 2 )
|
||||
{
|
||||
if( InRange( x2r, xi, xf ) && InRange( y2r, yi, yf ) )
|
||||
@ -236,6 +264,7 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
// first segment is an arc, second segment is straight
|
||||
int ret;
|
||||
double x1r, y1r, x2r, y2r;
|
||||
|
||||
if( xf2 == xi2 )
|
||||
{
|
||||
// vertical second segment
|
||||
@ -251,14 +280,17 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
ret = FindLineSegmentIntersection( a, b, xi, yi, xf, yf, style,
|
||||
&x1r, &y1r, &x2r, &y2r );
|
||||
}
|
||||
|
||||
if( ret == 0 )
|
||||
return 0;
|
||||
|
||||
if( InRange( x1r, xi2, xf2 ) && InRange( y1r, yi2, yf2 ) )
|
||||
{
|
||||
xr[iret] = x1r;
|
||||
yr[iret] = y1r;
|
||||
iret++;
|
||||
}
|
||||
|
||||
if( ret == 2 )
|
||||
{
|
||||
if( InRange( x2r, xi2, xf2 ) && InRange( y2r, yi2, yf2 ) )
|
||||
@ -277,12 +309,15 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
MakeEllipseFromArc( xi, yi, xf, yf, style, &el1 );
|
||||
MakeEllipseFromArc( xi2, yi2, xf2, yf2, style2, &el2 );
|
||||
int n;
|
||||
|
||||
if( el1.xrad + el1.yrad > el2.xrad + el2.yrad )
|
||||
n = GetArcIntersections( &el1, &el2 );
|
||||
else
|
||||
n = GetArcIntersections( &el2, &el1 );
|
||||
|
||||
iret = n;
|
||||
}
|
||||
|
||||
if( x && y )
|
||||
{
|
||||
for( int i = 0; i<iret; i++ )
|
||||
@ -291,9 +326,11 @@ int FindSegmentIntersections( int xi, int yi, int xf, int yf, int style,
|
||||
y[i] = yr[i];
|
||||
}
|
||||
}
|
||||
|
||||
return iret;
|
||||
}
|
||||
|
||||
|
||||
// find intersection between line y = a + bx and line segment (xi,yi) to (xf,yf)
|
||||
// if b > DBL_MAX/10, assume vertical line at x = a
|
||||
// the line segment may be an arc (i.e. quadrant of an ellipse)
|
||||
@ -308,6 +345,7 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
{
|
||||
double xx = 0, yy = 0; // Init made to avoid C compil "uninitialized" warning
|
||||
bool bVert = false;
|
||||
|
||||
if( b > DBL_MAX / 10.0 )
|
||||
bVert = true;
|
||||
|
||||
@ -320,6 +358,7 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
// put into form y = c + dx;
|
||||
double d = (double) (yf - yi) / (double) (xf - xi);
|
||||
double c = yf - d * xf;
|
||||
|
||||
if( bVert )
|
||||
{
|
||||
// if vertical line, easy
|
||||
@ -333,9 +372,11 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
{
|
||||
if( dist )
|
||||
*dist = min( abs( a - xi ), abs( a - xf ) );
|
||||
|
||||
return 0;
|
||||
}
|
||||
}
|
||||
|
||||
if( fabs( b - d ) < 1E-12 )
|
||||
{
|
||||
// parallel lines
|
||||
@ -343,11 +384,14 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
{
|
||||
*dist = GetPointToLineDistance( a, b, xi, xf );
|
||||
}
|
||||
|
||||
return 0; // lines parallel
|
||||
}
|
||||
|
||||
// calculate intersection
|
||||
xx = (c - a) / (b - d);
|
||||
yy = a + b * (xx);
|
||||
|
||||
// see if intersection is within the line segment
|
||||
if( yf == yi )
|
||||
{
|
||||
@ -368,6 +412,7 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
// arc (quadrant of ellipse)
|
||||
// convert to clockwise arc
|
||||
int xxi, xxf, yyi, yyf;
|
||||
|
||||
if( style == CPolyLine::ARC_CCW )
|
||||
{
|
||||
xxi = xf;
|
||||
@ -382,8 +427,10 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
yyi = yi;
|
||||
yyf = yf;
|
||||
}
|
||||
|
||||
// find center and radii of ellipse
|
||||
double xo = xxf, yo = yyi, rx, ry; // Init made to avoid C compil warnings
|
||||
|
||||
if( xxf > xxi && yyf > yyi )
|
||||
{
|
||||
xo = xxf;
|
||||
@ -404,17 +451,21 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
xo = xxi;
|
||||
yo = yyf;
|
||||
}
|
||||
|
||||
rx = fabs( (double) (xxi - xxf) );
|
||||
ry = fabs( (double) (yyi - yyf) );
|
||||
bool test;
|
||||
double xx1, xx2, yy1, yy2, aa;
|
||||
|
||||
if( bVert )
|
||||
{
|
||||
// shift vertical line to coordinate system of ellipse
|
||||
aa = a - xo;
|
||||
test = FindVerticalLineEllipseIntersections( rx, ry, aa, &yy1, &yy2 );
|
||||
|
||||
if( !test )
|
||||
return 0;
|
||||
|
||||
// shift back to PCB coordinates
|
||||
yy1 += yo;
|
||||
yy2 += yo;
|
||||
@ -426,8 +477,10 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
// shift line to coordinate system of ellipse
|
||||
aa = a + b * xo - yo;
|
||||
test = FindLineEllipseIntersections( rx, ry, aa, b, &xx1, &xx2 );
|
||||
|
||||
if( !test )
|
||||
return 0;
|
||||
|
||||
// shift back to PCB coordinates
|
||||
yy1 = aa + b * xx1;
|
||||
xx1 += xo;
|
||||
@ -436,7 +489,9 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
xx2 += xo;
|
||||
yy2 += yo;
|
||||
}
|
||||
|
||||
int npts = 0;
|
||||
|
||||
if( (xxf>xxi && xx1<xxf && xx1>xxi) || (xxf<xxi && xx1<xxi && xx1>xxf) )
|
||||
{
|
||||
if( (yyf>yyi && yy1<yyf && yy1>yyi) || (yyf<yyi && yy1<yyi && yy1>yyf) )
|
||||
@ -446,6 +501,7 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
npts = 1;
|
||||
}
|
||||
}
|
||||
|
||||
if( (xxf>xxi && xx2<xxf && xx2>xxi) || (xxf<xxi && xx2<xxi && xx2>xxf) )
|
||||
{
|
||||
if( (yyf>yyi && yy2<yyf && yy2>yyi) || (yyf<yyi && yy2<yyi && yy2>yyf) )
|
||||
@ -464,6 +520,7 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return npts;
|
||||
}
|
||||
else
|
||||
@ -474,16 +531,20 @@ int FindLineSegmentIntersection( double a, double b, int xi, int yi, int xf, int
|
||||
// vertical line segment
|
||||
if( bVert )
|
||||
return 0;
|
||||
|
||||
xx = xi;
|
||||
yy = a + b * xx;
|
||||
|
||||
if( (yy>=yi && yy>yf) || (yy<=yi && yy<yf) )
|
||||
return 0;
|
||||
}
|
||||
|
||||
*x1 = xx;
|
||||
*y1 = yy;
|
||||
return 1;
|
||||
}
|
||||
|
||||
|
||||
/*
|
||||
* Function TestForIntersectionOfStraightLineSegments
|
||||
* Test for intersection of line segments
|
||||
@ -496,6 +557,7 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
int* x, int* y, double* d )
|
||||
{
|
||||
double a, b, dist;
|
||||
|
||||
// first, test for intersection
|
||||
if( x1i == x1f && x2i == x2f )
|
||||
{
|
||||
@ -513,10 +575,13 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
if( x )
|
||||
*x = x1i;
|
||||
|
||||
if( y )
|
||||
*y = y2i;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -528,10 +593,13 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
if( x )
|
||||
*x = x2i;
|
||||
|
||||
if( y )
|
||||
*y = y1i;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -539,21 +607,26 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
// first segment vertical, second oblique
|
||||
// get a and b for second line segment, so that y = a + bx;
|
||||
b = (double)(y2f-y2i)/(x2f-x2i);
|
||||
b = double( y2f - y2i ) / (x2f - x2i);
|
||||
a = (double) y2i - b * x2i;
|
||||
|
||||
double x1, y1, x2, y2;
|
||||
int test = FindLineSegmentIntersection( a, b, x1i, y1i, x1f, y1f, CPolyLine::STRAIGHT,
|
||||
&x1, &y1, &x2, &y2 );
|
||||
|
||||
if( test )
|
||||
{
|
||||
if( InRange( y1, y1i, y1f ) && InRange( x1, x2i, x2f ) && InRange( y1, y2i, y2f ) )
|
||||
{
|
||||
if( x )
|
||||
*x = (int) x1;
|
||||
|
||||
if( y )
|
||||
*y = (int) y1;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -562,21 +635,26 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
// first segment horizontal, second oblique
|
||||
// get a and b for second line segment, so that y = a + bx;
|
||||
b = (double)(y2f-y2i)/(x2f-x2i);
|
||||
b = double( y2f - y2i ) / (x2f - x2i);
|
||||
a = (double) y2i - b * x2i;
|
||||
|
||||
double x1, y1, x2, y2;
|
||||
int test = FindLineSegmentIntersection( a, b, x1i, y1i, x1f, y1f, CPolyLine::STRAIGHT,
|
||||
&x1, &y1, &x2, &y2 );
|
||||
|
||||
if( test )
|
||||
{
|
||||
if( InRange( x1, x1i, x1f ) && InRange( x1, x2i, x2f ) && InRange( y1, y2i, y2f ) )
|
||||
{
|
||||
if( x )
|
||||
*x = (int) x1;
|
||||
|
||||
if( y )
|
||||
*y = (int) y1;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -585,21 +663,26 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
// second segment vertical, first oblique
|
||||
// get a and b for first line segment, so that y = a + bx;
|
||||
b = (double)(y1f-y1i)/(x1f-x1i);
|
||||
b = double( y1f - y1i ) / (x1f - x1i);
|
||||
a = (double) y1i - b * x1i;
|
||||
|
||||
double x1, y1, x2, y2;
|
||||
int test = FindLineSegmentIntersection( a, b, x2i, y2i, x2f, y2f, CPolyLine::STRAIGHT,
|
||||
&x1, &y1, &x2, &y2 );
|
||||
|
||||
if( test )
|
||||
{
|
||||
if( InRange( x1, x1i, x1f ) && InRange( y1, y1i, y1f ) && InRange( y1, y2i, y2f ) )
|
||||
{
|
||||
if( x )
|
||||
*x = (int) x1;
|
||||
|
||||
if( y )
|
||||
*y = (int) y1;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -608,21 +691,26 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
// second segment horizontal, first oblique
|
||||
// get a and b for second line segment, so that y = a + bx;
|
||||
b = (double)(y1f-y1i)/(x1f-x1i);
|
||||
b = double( y1f - y1i ) / (x1f - x1i);
|
||||
a = (double) y1i - b * x1i;
|
||||
|
||||
double x1, y1, x2, y2;
|
||||
int test = FindLineSegmentIntersection( a, b, x2i, y2i, x2f, y2f, CPolyLine::STRAIGHT,
|
||||
&x1, &y1, &x2, &y2 );
|
||||
|
||||
if( test )
|
||||
{
|
||||
if( InRange( x1, x1i, x1f ) && InRange( y1, y1i, y1f ) )
|
||||
{
|
||||
if( x )
|
||||
*x = (int) x1;
|
||||
|
||||
if( y )
|
||||
*y = (int) y1;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
@ -630,14 +718,25 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
else
|
||||
{
|
||||
// both segments oblique
|
||||
if( (long)(y1f-y1i)*(x2f-x2i) != (long)(y2f-y2i)*(x1f-x1i) )
|
||||
if( long( y1f - y1i ) * (x2f - x2i) != long( y2f - y2i ) * (x1f - x1i) )
|
||||
{
|
||||
// not parallel, get a and b for first line segment, so that y = a + bx;
|
||||
b = (double)(y1f-y1i)/(x1f-x1i);
|
||||
b = double( y1f - y1i ) / (x1f - x1i);
|
||||
a = (double) y1i - b * x1i;
|
||||
|
||||
double x1, y1, x2, y2;
|
||||
int test = FindLineSegmentIntersection( a, b, x2i, y2i, x2f, y2f, CPolyLine::STRAIGHT,
|
||||
&x1, &y1, &x2, &y2 );
|
||||
int test = FindLineSegmentIntersection( a,
|
||||
b,
|
||||
x2i,
|
||||
y2i,
|
||||
x2f,
|
||||
y2f,
|
||||
CPolyLine::STRAIGHT,
|
||||
&x1,
|
||||
&y1,
|
||||
&x2,
|
||||
&y2 );
|
||||
|
||||
// both segments oblique
|
||||
if( test )
|
||||
{
|
||||
@ -645,46 +744,60 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
{
|
||||
if( x )
|
||||
*x = (int) x1;
|
||||
|
||||
if( y )
|
||||
*y = (int) y1;
|
||||
|
||||
if( d )
|
||||
*d = 0.0;
|
||||
|
||||
return true;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// don't intersect, get shortest distance between each endpoint and the other line segment
|
||||
dist = GetPointToLineSegmentDistance( x1i, y1i, x2i, y2i, x2f, y2f );
|
||||
|
||||
double xx = x1i;
|
||||
double yy = y1i;
|
||||
double dd = GetPointToLineSegmentDistance( x1f, y1f, x2i, y2i, x2f, y2f );
|
||||
|
||||
if( dd < dist )
|
||||
{
|
||||
dist = dd;
|
||||
xx = x1f;
|
||||
yy = y1f;
|
||||
}
|
||||
|
||||
dd = GetPointToLineSegmentDistance( x2i, y2i, x1i, y1i, x1f, y1f );
|
||||
|
||||
if( dd < dist )
|
||||
{
|
||||
dist = dd;
|
||||
xx = x2i;
|
||||
yy = y2i;
|
||||
}
|
||||
|
||||
dd = GetPointToLineSegmentDistance( x2f, y2f, x1i, y1i, x1f, y1f );
|
||||
|
||||
if( dd < dist )
|
||||
{
|
||||
dist = dd;
|
||||
xx = x2f;
|
||||
yy = y2f;
|
||||
}
|
||||
|
||||
if( x )
|
||||
*x = (int) xx;
|
||||
|
||||
if( y )
|
||||
*y = (int) yy;
|
||||
|
||||
if( d )
|
||||
*d = dist;
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
@ -694,14 +807,17 @@ bool TestForIntersectionOfStraightLineSegments( int x1i, int y1i, int x1f, int y
|
||||
bool Quadratic( double a, double b, double c, double* x1, double* x2 )
|
||||
{
|
||||
double root = b * b - 4.0 * a * c;
|
||||
|
||||
if( root < 0.0 )
|
||||
return false;
|
||||
|
||||
root = sqrt( root );
|
||||
*x1 = (-b + root) / (2.0 * a);
|
||||
*x2 = (-b - root) / (2.0 * a);
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
// finds intersections of vertical line at x
|
||||
// with ellipse defined by (x^2)/(a^2) + (y^2)/(b^2) = 1;
|
||||
// returns true if solution exist, with solutions in y1 and y2
|
||||
@ -710,13 +826,16 @@ bool Quadratic( double a, double b, double c, double *x1, double *x2 )
|
||||
bool FindVerticalLineEllipseIntersections( double a, double b, double x, double* y1, double* y2 )
|
||||
{
|
||||
double y_sqr = ( 1.0 - (x * x) / (a * a) ) * b * b;
|
||||
|
||||
if( y_sqr < 0.0 )
|
||||
return false;
|
||||
|
||||
*y1 = sqrt( y_sqr );
|
||||
*y2 = -*y1;
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
// finds intersections of straight line y = c + dx
|
||||
// with ellipse defined by (x^2)/(a^2) + (y^2)/(b^2) = 1;
|
||||
// returns true if solution exist, with solutions in x1 and x2
|
||||
@ -728,6 +847,7 @@ bool FindLineEllipseIntersections( double a, double b, double c, double d, doubl
|
||||
double A = d * d + b * b / (a * a);
|
||||
double B = 2.0 * c * d;
|
||||
double C = c * c - b * b;
|
||||
|
||||
return Quadratic( A, B, C, x1, x2 );
|
||||
}
|
||||
|
||||
@ -742,12 +862,16 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
{
|
||||
// check clearance between bounding rectangles
|
||||
int test = max_cl + w1 / 2 + w2 / 2;
|
||||
|
||||
if( min( x1i, x1f ) - max( x2i, x2f ) > test )
|
||||
return max_cl;
|
||||
|
||||
if( min( x2i, x2f ) - max( x1i, x1f ) > test )
|
||||
return max_cl;
|
||||
|
||||
if( min( y1i, y1f ) - max( y2i, y2f ) > test )
|
||||
return max_cl;
|
||||
|
||||
if( min( y2i, y2f ) - max( y1i, y1f ) > test )
|
||||
return max_cl;
|
||||
|
||||
@ -759,10 +883,13 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
TestForIntersectionOfStraightLineSegments( x1i, y1i, x1f, y1f,
|
||||
x2i, y2i, x2f, y2f, &xx, &yy, &dd );
|
||||
int d = max( 0, (int) dd - w1 / 2 - w2 / 2 );
|
||||
|
||||
if( x )
|
||||
*x = xx;
|
||||
|
||||
if( y )
|
||||
*y = yy;
|
||||
|
||||
return d;
|
||||
}
|
||||
|
||||
@ -770,13 +897,17 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
// see if segments intersect
|
||||
double xr[2];
|
||||
double yr[2];
|
||||
test = FindSegmentIntersections( x1i, y1i, x1f, y1f, style1, x2i, y2i, x2f, y2f, style2, xr, yr );
|
||||
test =
|
||||
FindSegmentIntersections( x1i, y1i, x1f, y1f, style1, x2i, y2i, x2f, y2f, style2, xr, yr );
|
||||
|
||||
if( test )
|
||||
{
|
||||
if( x )
|
||||
*x = (int) xr[0];
|
||||
|
||||
if( y )
|
||||
*y = (int) yr[0];
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
@ -785,6 +916,7 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
EllipseKH el2;
|
||||
bool bArcs;
|
||||
int xi = 0, yi = 0, xf = 0, yf = 0;
|
||||
|
||||
if( style2 == CPolyLine::STRAIGHT )
|
||||
{
|
||||
// style1 = arc, style2 = straight
|
||||
@ -812,12 +944,14 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
MakeEllipseFromArc( x2i, y2i, x2f, y2f, style2, &el2 );
|
||||
bArcs = true;
|
||||
}
|
||||
|
||||
const int NSTEPS = 32;
|
||||
|
||||
if( el1.theta2 > el1.theta1 )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
}
|
||||
|
||||
if( bArcs && el2.theta2 > el2.theta1 )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
@ -827,6 +961,7 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
double th1;
|
||||
double th2;
|
||||
double len2;
|
||||
|
||||
if( bArcs )
|
||||
{
|
||||
th1 = el2.theta1;
|
||||
@ -839,6 +974,7 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
th2 = 0.0;
|
||||
len2 = abs( xf - xi ) + abs( yf - yi );
|
||||
}
|
||||
|
||||
double s_start = el1.theta1;
|
||||
double s_end = el1.theta2;
|
||||
double s_start2 = th1;
|
||||
@ -850,29 +986,39 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
int nsteps2 = NSTEPS;
|
||||
double step = (s_start - s_end) / (nsteps - 1);
|
||||
double step2 = (s_start2 - s_end2) / (nsteps2 - 1);
|
||||
|
||||
while( ( step * max( el1.xrad, el1.yrad ) ) > 0.1 * NM_PER_MIL
|
||||
&& (step2 * len2) > 0.1 * NM_PER_MIL )
|
||||
{
|
||||
step = (s_start - s_end) / (nsteps - 1);
|
||||
|
||||
for( int i = 0; i<nsteps; i++ )
|
||||
{
|
||||
double s;
|
||||
|
||||
if( i < nsteps - 1 )
|
||||
s = s_start - i * step;
|
||||
else
|
||||
s = s_end;
|
||||
|
||||
double x = el1.Center.X + el1.xrad * cos( s );
|
||||
|
||||
double y = el1.Center.Y + el1.yrad * sin( s );
|
||||
|
||||
// if not an arc, use s2 as fractional distance along line
|
||||
step2 = (s_start2 - s_end2) / (nsteps2 - 1);
|
||||
|
||||
for( int i2 = 0; i2<nsteps2; i2++ )
|
||||
{
|
||||
double s2;
|
||||
|
||||
if( i2 < nsteps2 - 1 )
|
||||
s2 = s_start2 - i2 * step2;
|
||||
else
|
||||
s2 = s_end2;
|
||||
|
||||
double x2, y2;
|
||||
|
||||
if( !bArcs )
|
||||
{
|
||||
x2 = xi + (xf - xi) * s2;
|
||||
@ -881,9 +1027,12 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
else
|
||||
{
|
||||
x2 = el2.Center.X + el2.xrad* cos( s2 );
|
||||
|
||||
y2 = el2.Center.Y + el2.yrad* sin( s2 );
|
||||
}
|
||||
|
||||
double d = Distance( (int) x, (int) y, (int) x2, (int) y2 );
|
||||
|
||||
if( d < dmin )
|
||||
{
|
||||
dmin = d;
|
||||
@ -894,6 +1043,7 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( step > step2 )
|
||||
{
|
||||
s_start = min( el1.theta1, smin + step );
|
||||
@ -907,10 +1057,13 @@ int GetClearanceBetweenSegments( int x1i, int y1i, int x1f, int y1f, int style1,
|
||||
step2 = (s_start2 - s_end2) / nsteps2;
|
||||
}
|
||||
}
|
||||
|
||||
if( x )
|
||||
*x = (int) xmin;
|
||||
|
||||
if( y )
|
||||
*y = (int) ymin;
|
||||
|
||||
return max( 0, (int) dmin - w1 / 2 - w2 / 2 ); // allow for widths
|
||||
}
|
||||
|
||||
@ -929,23 +1082,29 @@ double GetPointToLineDistance( double a, double b, int x, int y, double * xpp, d
|
||||
*xpp = a;
|
||||
*ypp = y;
|
||||
}
|
||||
|
||||
return abs( a - x );
|
||||
}
|
||||
|
||||
// find c,d such that (x,y) lies on y = c + dx where d=(-1/b)
|
||||
double d = -1.0 / b;
|
||||
double c = (double) y - d * x;
|
||||
|
||||
// find nearest point to (x,y) on line through (xi,yi) to (xf,yf)
|
||||
double xp = (a - c) / (d - b);
|
||||
double yp = a + b * xp;
|
||||
|
||||
if( xpp && ypp )
|
||||
{
|
||||
*xpp = xp;
|
||||
*ypp = yp;
|
||||
}
|
||||
|
||||
// find distance
|
||||
return Distance( x, y, (int) xp, (int) yp );
|
||||
}
|
||||
|
||||
|
||||
/***********************************************************************************/
|
||||
double GetPointToLineSegmentDistance( int x, int y, int xi, int yi, int xf, int yf )
|
||||
/***********************************************************************************/
|
||||
@ -981,12 +1140,15 @@ double GetPointToLineSegmentDistance( int x, int y, int xi, int yi, int xf, int
|
||||
// find a,b such that (xi,yi) and (xf,yf) lie on y = a + bx
|
||||
double b = (double) (yf - yi) / (xf - xi);
|
||||
double a = (double) yi - b * xi;
|
||||
|
||||
// find c,d such that (x,y) lies on y = c + dx where d=(-1/b)
|
||||
double d = -1.0 / b;
|
||||
double c = (double) y - d * x;
|
||||
|
||||
// find nearest point to (x,y) on line through (xi,yi) to (xf,yf)
|
||||
double xp = (a - c) / (d - b);
|
||||
double yp = a + b * xp;
|
||||
|
||||
// find distance
|
||||
if( InRange( xp, xi, xf ) && InRange( yp, yi, yf ) )
|
||||
return Distance( x, y, (int) xp, (int) yp );
|
||||
@ -995,6 +1157,7 @@ double GetPointToLineSegmentDistance( int x, int y, int xi, int yi, int xf, int
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
// test for value within range
|
||||
//
|
||||
bool InRange( double x, double xi, double xf )
|
||||
@ -1009,22 +1172,31 @@ bool InRange( double x, double xi, double xf )
|
||||
if( x >= xf && x <= xi )
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
|
||||
// Get distance between 2 points
|
||||
//
|
||||
double Distance( int x1, int y1, int x2, int y2 )
|
||||
{
|
||||
double d;
|
||||
d = sqrt( (double)(x1-x2)*(x1-x2) + (double)(y1-y2)*(y1-y2) );
|
||||
double dx = x1 - x2;
|
||||
double dy = y1 - y2;
|
||||
|
||||
double d = sqrt( dx * dx + dy * dy );
|
||||
|
||||
if( d > INT_MAX || d < INT_MIN )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
}
|
||||
return (int)d;
|
||||
|
||||
// wxASSERT( d <= INT_MAX && d >= INT_MIN );
|
||||
|
||||
return int( d );
|
||||
}
|
||||
|
||||
|
||||
// this finds approximate solutions
|
||||
// note: this works best if el2 is smaller than el1
|
||||
//
|
||||
@ -1035,6 +1207,7 @@ int GetArcIntersections( EllipseKH * el1, EllipseKH * el2,
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
}
|
||||
|
||||
if( el2->theta2 > el2->theta1 )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
@ -1045,6 +1218,7 @@ int GetArcIntersections( EllipseKH * el1, EllipseKH * el2,
|
||||
|
||||
double xscale = 1.0 / el1->xrad;
|
||||
double yscale = 1.0 / el1->yrad;
|
||||
|
||||
// now transform params of second ellipse into reference frame
|
||||
// with origin at center if first ellipse,
|
||||
// scaled so the first ellipse is a circle of radius = 1.0
|
||||
@ -1052,25 +1226,34 @@ int GetArcIntersections( EllipseKH * el1, EllipseKH * el2,
|
||||
double yo = (el2->Center.Y - el1->Center.Y) * yscale;
|
||||
double xr = el2->xrad * xscale;
|
||||
double yr = el2->yrad * yscale;
|
||||
|
||||
// now test NSTEPS positions in arc, moving clockwise (ie. decreasing theta)
|
||||
double step = M_PI / ( (NSTEPS - 1) * 2.0 );
|
||||
double d_prev = 0;
|
||||
double th_interp;
|
||||
double th1;
|
||||
|
||||
int n = 0;
|
||||
|
||||
for( int i = 0; i<NSTEPS; i++ )
|
||||
{
|
||||
double theta;
|
||||
|
||||
if( i < NSTEPS - 1 )
|
||||
theta = el2->theta1 - i * step;
|
||||
else
|
||||
theta = el2->theta2;
|
||||
|
||||
double x = xo + xr * cos( theta );
|
||||
|
||||
double y = yo + yr * sin( theta );
|
||||
|
||||
double d = 1.0 - sqrt( x * x + y * y );
|
||||
|
||||
if( i>0 )
|
||||
{
|
||||
bool bInt = false;
|
||||
|
||||
if( d >= 0.0 && d_prev <= 0.0 )
|
||||
{
|
||||
th_interp = theta + ( step * (-d_prev) ) / (d - d_prev);
|
||||
@ -1081,16 +1264,21 @@ int GetArcIntersections( EllipseKH * el1, EllipseKH * el2,
|
||||
th_interp = theta + (step * d_prev) / (d_prev - d);
|
||||
bInt = true;
|
||||
}
|
||||
|
||||
if( bInt )
|
||||
{
|
||||
x = xo + xr * cos( th_interp );
|
||||
|
||||
y = yo + yr * sin( th_interp );
|
||||
|
||||
th1 = atan2( y, x );
|
||||
|
||||
if( th1 <= el1->theta1 && th1 >= el1->theta2 )
|
||||
{
|
||||
xret[n] = x * el1->xrad + el1->Center.X;
|
||||
yret[n] = y * el1->yrad + el1->Center.Y;
|
||||
n++;
|
||||
|
||||
if( n > 2 )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
@ -1098,19 +1286,26 @@ int GetArcIntersections( EllipseKH * el1, EllipseKH * el2,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
d_prev = d;
|
||||
}
|
||||
|
||||
if( x1 )
|
||||
*x1 = xret[0];
|
||||
|
||||
if( y1 )
|
||||
*y1 = yret[0];
|
||||
|
||||
if( x2 )
|
||||
*x2 = xret[1];
|
||||
|
||||
if( y2 )
|
||||
*y2 = yret[1];
|
||||
|
||||
return n;
|
||||
}
|
||||
|
||||
|
||||
// this finds approximate solution
|
||||
//
|
||||
// double GetSegmentClearance( EllipseKH * el1, EllipseKH * el2,
|
||||
@ -1123,6 +1318,7 @@ double GetArcClearance( EllipseKH * el1, EllipseKH * el2,
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
}
|
||||
|
||||
if( el2->theta2 > el2->theta1 )
|
||||
{
|
||||
wxASSERT( 0 );
|
||||
@ -1140,30 +1336,40 @@ double GetArcClearance( EllipseKH * el1, EllipseKH * el2,
|
||||
int nsteps2 = NSTEPS;
|
||||
double step = (th_start - th_end) / (nsteps - 1);
|
||||
double step2 = (th_start2 - th_end2) / (nsteps2 - 1);
|
||||
|
||||
while( ( step * max( el1->xrad, el1->yrad ) ) > 1.0 * NM_PER_MIL
|
||||
&& ( step2 * max( el2->xrad, el2->yrad ) ) > 1.0 * NM_PER_MIL )
|
||||
{
|
||||
step = (th_start - th_end) / (nsteps - 1);
|
||||
|
||||
for( int i = 0; i<nsteps; i++ )
|
||||
{
|
||||
double theta;
|
||||
|
||||
if( i < nsteps - 1 )
|
||||
theta = th_start - i * step;
|
||||
else
|
||||
theta = th_end;
|
||||
|
||||
double x = el1->Center.X + el1->xrad * cos( theta );
|
||||
|
||||
double y = el1->Center.Y + el1->yrad * sin( theta );
|
||||
|
||||
step2 = (th_start2 - th_end2) / (nsteps2 - 1);
|
||||
|
||||
for( int i2 = 0; i2<nsteps2; i2++ )
|
||||
{
|
||||
double theta2;
|
||||
|
||||
if( i2 < nsteps2 - 1 )
|
||||
theta2 = th_start2 - i2 * step2;
|
||||
else
|
||||
theta2 = th_end2;
|
||||
|
||||
double x2 = el2->Center.X + el2->xrad * cos( theta2 );
|
||||
double y2 = el2->Center.Y + el2->yrad * sin( theta2 );
|
||||
double d = Distance( (int) x, (int) y, (int) x2, (int) y2 );
|
||||
|
||||
if( d < dmin )
|
||||
{
|
||||
dmin = d;
|
||||
@ -1174,6 +1380,7 @@ double GetArcClearance( EllipseKH * el1, EllipseKH * el2,
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if( step > step2 )
|
||||
{
|
||||
th_start = min( el1->theta1, thmin + step );
|
||||
@ -1187,9 +1394,12 @@ double GetArcClearance( EllipseKH * el1, EllipseKH * el2,
|
||||
step2 = (th_start2 - th_end2) / nsteps2;
|
||||
}
|
||||
}
|
||||
|
||||
if( x1 )
|
||||
*x1 = xmin;
|
||||
|
||||
if( y1 )
|
||||
*y1 = ymin;
|
||||
|
||||
return dmin;
|
||||
}
|
||||
|
||||
Loading…
x
Reference in New Issue
Block a user