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
|
--- nurbs/nurbs.cpp.orig Fri May 24 10:25:49 2002
+++ nurbs/nurbs.cpp Fri Dec 1 00:22:20 2006
@@ -28,7 +28,7 @@
#include <nurbsS.h>
#include "integrate.h"
-#include <malloc.h>
+#include <stdlib.h>
/*!
*/
@@ -391,9 +391,9 @@
T du,dv ;
// compute a coarse distance for the curve
Point_nD<T,N> a,b,c ;
- a = pointAt(0.0) ;
- b = pointAt(0.5) ;
- c = pointAt(1.0) ;
+ a = this->pointAt(0.0) ;
+ b = this->pointAt(0.5) ;
+ c = this->pointAt(1.0) ;
T distance = norm(b-a) + norm(c-b) ;
@@ -5202,7 +5202,7 @@
*/
template <class T, int N>
BasicList<Point_nD<T,N> > NurbsCurve<T,N>::tesselate(T tolerance,BasicList<T> *uk) const {
- BasicList<Point_nD<T,N> > list,list2 ;
+ BasicList<Point_nD<T,N> > list, list2 ;
NurbsCurveArray<T,N> ca ;
decompose(ca) ;
@@ -5249,7 +5249,7 @@
}
else{
for(int i=0;i<ca.n();++i){
- list2 = ca[i].tesselate(tolerance,uk) ;
+ list2 = ca[i].tesselate(tolerance,uk).by_ref() ;
// remove the last point from the list to elliminate
list.erase((BasicNode<Point_nD<T,N> >*)list.last()) ;
|
