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
|
/****************************************************************************
* VCGLib o o *
* Visual and Computer Graphics Library o o *
* _ O _ *
* Copyright(C) 2004-2016 \/)\/ *
* Visual Computing Lab /\/| *
* ISTI - Italian National Research Council | *
* \ *
* All rights reserved. *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License (http://www.gnu.org/licenses/gpl.txt) *
* for more details. *
* *
****************************************************************************/
/****************************************************************************
History
****************************************************************************/
#ifndef __VCGLIB_EDGE_DISTANCE
#define __VCGLIB_EDGE_DISTANCE
#include <vcg/math/base.h>
#include <vcg/space/point3.h>
#include <vcg/space/distance3.h>
#include <vcg/space/segment3.h>
namespace vcg {
namespace edge{
/*Point edge distance*/
template <class EdgeType>
bool PointDistance( const EdgeType &e,
const vcg::Point3<typename EdgeType::ScalarType> & q,
typename EdgeType::ScalarType & dist,
vcg::Point3<typename EdgeType::ScalarType> & p )
{
vcg::Segment3<typename EdgeType::ScalarType> s;
s.P0()=e.V(0)->P();
s.P1()=e.V(1)->P();
typename EdgeType::CoordType nearest;
typename EdgeType::ScalarType d;
// nearest=vcg::ClosestPoint<typename EdgeType::ScalarType>(s,q);
// d=(q-nearest).Norm();
vcg::SegmentPointDistance(s,q ,nearest,d);
if (d<dist){
dist=d;
p=nearest;
return true;
}
else
return false;
}
template <class S>
class PointDistanceFunctor {
public:
typedef S ScalarType;
typedef Point3<ScalarType> QueryType;
static inline const Point3<ScalarType> & Pos(const QueryType & qt) {return qt;}
template <class EDGETYPE, class SCALARTYPE>
inline bool operator () (const EDGETYPE & e, const Point3<SCALARTYPE> & p, SCALARTYPE & minDist, Point3<SCALARTYPE> & q) {
const Point3<typename EDGETYPE::ScalarType> fp = Point3<typename EDGETYPE::ScalarType>::Construct(p);
Point3<typename EDGETYPE::ScalarType> fq;
typename EDGETYPE::ScalarType md = (typename EDGETYPE::ScalarType)(minDist);
const bool ret = vcg::edge::PointDistance(e, fp, md, fq);
minDist = (SCALARTYPE)(md);
q = Point3<SCALARTYPE>::Construct(fq);
return (ret);
}
};
template <class EdgeType>
typename EdgeType::ScalarType Length(const EdgeType &e)
{
return Distance(e.cV(0)->cP(),e.cV(1)->cP());
}
template <class EdgeType>
typename EdgeType::VertexType::CoordType Center(const EdgeType &e)
{
return (e.cV(0)->cP()+e.cV(1)->cP())/2.0;
}
} // end namespace edge
} // end namespace vcg
#endif
|
