Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
Guilhem Saurel
ndcurves
Commits
e201b5f2
Commit
e201b5f2
authored
May 25, 2018
by
Pierre Fernbach
Browse files
implement curve splitting with deCasteljau's algorithm
parent
941872a5
Changes
2
Hide whitespace changes
Inline
Side-by-side
include/spline/bezier_curve.h
View file @
e201b5f2
...
...
@@ -298,6 +298,41 @@ struct bezier_curve : public curve_abc<Time, Numeric, Dim, Safe, Point>
}
/**
* @brief split split the curve in 2 at time t
* @param t
* @return
*/
std
::
pair
<
bezier_curve_t
,
bezier_curve_t
>
split
(
const
Numeric
T
){
t_point_t
wps_first
(
size_
),
wps_second
(
size_
);
const
double
t
=
T
/
T_
;
wps_first
[
0
]
=
pts_
.
front
();
wps_second
[
degree_
]
=
pts_
.
back
();
t_point_t
casteljau_pts
=
waypoints
();
size_t
id
=
1
;
while
(
casteljau_pts
.
size
()
>
1
){
casteljau_pts
=
deCasteljauReduction
(
casteljau_pts
,
t
);
wps_first
[
id
]
=
casteljau_pts
.
front
();
wps_second
[
degree_
-
id
]
=
casteljau_pts
.
back
();
++
id
;
}
bezier_curve_t
c_first
(
wps_first
.
begin
(),
wps_first
.
end
(),
T
,
mult_T_
);
bezier_curve_t
c_second
(
wps_second
.
begin
(),
wps_second
.
end
(),
T_
-
T
,
mult_T_
);
return
std
::
make_pair
(
c_first
,
c_second
);
}
bezier_curve_t
extract
(
const
Numeric
t1
,
const
Numeric
t2
){
if
(
t1
<
0.
||
t1
>
T_
||
t2
<
0.
||
t2
>
T_
)
throw
std
::
out_of_range
(
"In Extract curve : times out of bounds"
);
if
(
t1
==
0.
)
return
split
(
t2
).
first
;
if
(
t2
==
T_
)
return
split
(
t1
).
second
;
std
::
pair
<
bezier_curve_t
,
bezier_curve_t
>
c_split
=
this
->
split
(
t1
);
return
c_split
.
second
->
split
(
t2
).
first
;
}
private:
template
<
typename
In
>
...
...
src/tests/spline_test/Main.cpp
View file @
e201b5f2
...
...
@@ -843,6 +843,82 @@ void BezierEvalDeCasteljau(bool& error){
}
/**
* @brief BezierSplitCurve test the 'split' method of bezier curve
* @param error
*/
void
BezierSplitCurve
(
bool
&
error
){
// test for degree 5
int
n
=
5
;
double
t_min
=
0.2
;
double
t_max
=
10
;
for
(
size_t
i
=
0
;
i
<
1
;
++
i
){
// build a random curve and split it at random time :
//std::cout<<"build a random curve"<<std::endl;
point_t
a
;
std
::
vector
<
point_t
>
wps
;
for
(
size_t
j
=
0
;
j
<=
n
;
++
j
){
wps
.
push_back
(
randomPoint
(
-
10.
,
10.
));
}
double
t
=
(
rand
()
/
(
double
)
RAND_MAX
)
*
(
t_max
-
t_min
)
+
t_min
;
double
ts
=
(
rand
()
/
(
double
)
RAND_MAX
)
*
(
t
);
bezier_curve_t
c
(
wps
.
begin
(),
wps
.
end
(),
t
);
std
::
pair
<
bezier_curve_t
,
bezier_curve_t
>
cs
=
c
.
split
(
ts
);
//std::cout<<"split curve of duration "<<t<<" at "<<ts<<std::endl;
// test on splitted curves :
if
(
!
((
c
.
degree_
==
cs
.
first
.
degree_
)
&&
(
c
.
degree_
==
cs
.
second
.
degree_
)
)){
error
=
true
;
std
::
cout
<<
" Degree of the splitted curve are not the same as the original curve"
<<
std
::
endl
;
}
if
(
c
.
max
()
!=
(
cs
.
first
.
max
()
+
cs
.
second
.
max
())){
error
=
true
;
std
::
cout
<<
"Duration of the splitted curve doesn't correspond to the original"
<<
std
::
endl
;
}
if
(
c
(
0
)
!=
cs
.
first
(
0
)){
error
=
true
;
std
::
cout
<<
"initial point of the splitted curve doesn't correspond to the original"
<<
std
::
endl
;
}
if
(
c
(
t
)
!=
cs
.
second
(
cs
.
second
.
max
())){
error
=
true
;
std
::
cout
<<
"final point of the splitted curve doesn't correspond to the original"
<<
std
::
endl
;
}
if
(
cs
.
first
.
max
()
!=
ts
){
error
=
true
;
std
::
cout
<<
"timing of the splitted curve doesn't correspond to the original"
<<
std
::
endl
;
}
if
(
cs
.
first
(
ts
)
!=
cs
.
second
(
0.
)){
error
=
true
;
std
::
cout
<<
"splitting point of the splitted curve doesn't correspond to the original"
<<
std
::
endl
;
}
// check along curve :
double
ti
=
0.
;
while
(
ti
<=
ts
){
if
((
cs
.
first
(
ti
)
-
c
(
ti
)).
norm
()
>
1e-14
){
error
=
true
;
std
::
cout
<<
"first splitted curve and original curve doesn't correspond, error = "
<<
cs
.
first
(
ti
)
-
c
(
ti
)
<<
std
::
endl
;
}
ti
+=
0.01
;
}
while
(
ti
<=
t
){
if
((
cs
.
second
(
ti
-
ts
)
-
c
(
ti
)).
norm
()
>
1e-14
){
error
=
true
;
std
::
cout
<<
"second splitted curve and original curve doesn't correspond, error = "
<<
cs
.
second
(
ti
-
ts
)
-
c
(
ti
)
<<
std
::
endl
;
}
ti
+=
0.01
;
}
}
}
int
main
(
int
/*argc*/
,
char
**
/*argv[]*/
)
{
...
...
@@ -866,7 +942,8 @@ int main(int /*argc*/, char** /*argv[]*/)
BezierDerivativeCurveTimeReparametrizationTest
(
error
);
BezierToPolynomConversionTest
(
error
);
BezierEvalDeCasteljau
(
error
);
if
(
error
)
BezierSplitCurve
(
error
);
if
(
error
)
{
std
::
cout
<<
"There were some errors
\n
"
;
return
-
1
;
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment