1514{
1515 double mindist=DBL_MAX;
1516 double tlen, plen;
1517 uint32_t t, seg=0;
1518 POINT4D start4d, end4d, projtmp;
1520 const POINT2D *start = NULL, *end = NULL;
1521
1522
1525
1526 if ( ! proj4d ) proj4d = &projtmp;
1527
1528
1530 {
1532 {
1534 if ( mindistout )
1536 }
1537 return 0.0;
1538 }
1539
1541
1543 {
1544 double dist_sqr;
1547
1548 if (dist_sqr < mindist)
1549 {
1550 mindist = dist_sqr;
1551 seg=t-1;
1552 if ( mindist == 0 )
1553 {
1554 LWDEBUG(3,
"Breaking on mindist=0");
1555 break;
1556 }
1557 }
1558
1559 start = end;
1560 }
1561 mindist = sqrt(mindist);
1562
1563 if ( mindistout ) *mindistout = mindist;
1564
1565 LWDEBUGF(3,
"Closest segment: %d", seg);
1566 LWDEBUGF(3,
"mindist: %g", mindist);
1567
1568
1569
1570
1571
1575
1576
1579
1581
1582
1584 {
1585 return 1.0;
1586 }
1587
1588 LWDEBUGF(3,
"Closest point on segment: %g,%g", proj.
x, proj.
y);
1589
1591
1593
1594
1595
1596 if ( tlen == 0 ) return 0;
1597
1598 plen=0;
1600 for (t=0; t<seg; t++, start=end)
1601 {
1604
1605 LWDEBUGF(4,
"Segment %d made plen %g", t, plen);
1606 }
1607
1609
1610 LWDEBUGF(3,
"plen %g, tlen %g", plen, tlen);
1611
1612 return plen/tlen;
1613}
double distance2d_pt_pt(const POINT2D *p1, const POINT2D *p2)
int getPoint4d_p(const POINTARRAY *pa, uint32_t n, POINT4D *point)
double distance2d_sqr_pt_seg(const POINT2D *p, const POINT2D *A, const POINT2D *B)
int p2d_same(const POINT2D *p1, const POINT2D *p2)
#define LWDEBUG(level, msg)
#define LWDEBUGF(level, msg,...)
static const POINT2D * getPoint2d_cp(const POINTARRAY *pa, uint32_t n)
Returns a POINT2D pointer into the POINTARRAY serialized_ptlist, suitable for reading from.
void closest_point_on_segment(const POINT4D *p, const POINT4D *A, const POINT4D *B, POINT4D *ret)
double ptarray_length_2d(const POINTARRAY *pts)
Find the 2d length of the given POINTARRAY (even if it's 3d)