Remove CVS keywords.
[mesa.git] / src / glu / sgi / libnurbs / nurbtess / sampledLine.cc
1 /*
2 ** License Applicability. Except to the extent portions of this file are
3 ** made subject to an alternative license as permitted in the SGI Free
4 ** Software License B, Version 1.1 (the "License"), the contents of this
5 ** file are subject only to the provisions of the License. You may not use
6 ** this file except in compliance with the License. You may obtain a copy
7 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
8 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
9 **
10 ** http://oss.sgi.com/projects/FreeB
11 **
12 ** Note that, as provided in the License, the Software is distributed on an
13 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
14 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
15 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
16 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
17 **
18 ** Original Code. The Original Code is: OpenGL Sample Implementation,
19 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
20 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
21 ** Copyright in any portions created by third parties is as indicated
22 ** elsewhere herein. All Rights Reserved.
23 **
24 ** Additional Notice Provisions: The application programming interfaces
25 ** established by SGI in conjunction with the Original Code are The
26 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
27 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
28 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
29 ** Window System(R) (Version 1.3), released October 19, 1998. This software
30 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
31 ** published by SGI, but has not been independently verified as being
32 ** compliant with the OpenGL(R) version 1.2.1 Specification.
33 **
34 */
35 /*
36 */
37
38 #include <stdlib.h>
39 #include <stdio.h>
40 #include <math.h> //for fabs()
41 #include "glimports.h"
42 #include "zlassert.h"
43 #include "sampledLine.h"
44
45 void sampledLine::setPoint(Int i, Real p[2])
46 {
47 points[i][0]=p[0];
48 points[i][1]=p[1];
49 }
50
51
52 /*insert this single line in front of the oldList*/
53 sampledLine* sampledLine::insert(sampledLine *oldList)
54 {
55 next = oldList;
56 return this;
57 }
58
59 void sampledLine::deleteList()
60 {
61 sampledLine *temp, *tempNext;
62 for(temp = this; temp != NULL; temp = tempNext)
63 {
64 tempNext = temp->next;
65 delete temp;
66 }
67 }
68
69
70 /*space of points[][2] is allocated*/
71 sampledLine::sampledLine(Int n_points)
72 {
73 npoints = n_points;
74 points = (Real2*) malloc(sizeof(Real2) * n_points);
75 assert(points);
76 next = NULL;
77 }
78
79 /*space of points[][2] is allocated and
80 *points are copied
81 */
82 sampledLine::sampledLine(Int n_points, Real2 pts[])
83 {
84 int i;
85 npoints = n_points;
86 points = (Real2*) malloc(sizeof(Real2) * n_points);
87 assert(points);
88 for(i=0; i<npoints; i++) {
89 points[i][0] = pts[i][0];
90 points[i][1] = pts[i][1];
91 }
92 next = NULL;
93 }
94
95 sampledLine::sampledLine(Real pt1[2], Real pt2[2])
96 {
97 npoints = 2;
98 points = (Real2*) malloc(sizeof(Real2) * 2);
99 assert(points);
100 points[0][0] = pt1[0];
101 points[0][1] = pt1[1];
102 points[1][0] = pt2[0];
103 points[1][1] = pt2[1];
104 next = NULL;
105 }
106
107 //needs tp call init to setup
108 sampledLine::sampledLine()
109 {
110 }
111
112 //warning: ONLY pointer is copies!!!
113 void sampledLine::init(Int n_points, Real2 *pts)
114 {
115 npoints = n_points;
116 points = pts;
117 }
118
119 /*points[] is dealocated
120 */
121 sampledLine::~sampledLine()
122 {
123 free(points);
124 }
125
126 void sampledLine::print()
127 {
128 int i;
129 printf("npoints=%i\n", npoints);
130
131 for(i=0; i<npoints; i++){
132 printf("(%f,%f)\n", points[i][0], points[i][1]);
133 }
134
135 }
136
137 void sampledLine::tessellate(Real u_reso, Real v_reso)
138 {
139 int i;
140
141 Int nu, nv, n;
142 nu = 1+(Int) (fabs((points[npoints-1][0] - points[0][0])) * u_reso);
143 nv = 1+(Int) (fabs((points[npoints-1][1] - points[0][1])) * v_reso);
144
145 if(nu > nv) n = nu;
146 else
147 n = nv;
148 if(n<1)
149 n = 1;
150 //du dv could be negative
151 Real du = (points[npoints-1][0] - points[0][0])/n;
152 Real dv = (points[npoints-1][1] - points[0][1])/n;
153 Real2 *temp = (Real2*) malloc(sizeof(Real2) * (n+1));
154 assert(temp);
155
156 Real u,v;
157 for(i=0, u=points[0][0], v=points[0][1]; i<n; i++, u+=du, v+=dv)
158 {
159 temp[i][0] = u;
160 temp[i][1] = v;
161 }
162 temp[n][0] = points[npoints-1][0];
163 temp[n][1] = points[npoints-1][1];
164
165 free(points);
166
167 npoints = n+1;
168 points = temp;
169
170 }
171
172 void sampledLine::tessellateAll(Real u_reso, Real v_reso)
173 {
174 sampledLine* temp;
175 for(temp = this; temp != NULL; temp = temp->next)
176 {
177 temp->tessellate(u_reso, v_reso);
178 }
179 }