summaryrefslogtreecommitdiffstats
path: root/src/jogl/classes/jogamp/opengl/glu/nurbs/Curve.java
blob: ce0387bff19568f20f6711b499ed0664706957e5 (plain)
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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
package jogamp.opengl.glu.nurbs;

/*
 ** License Applicability. Except to the extent portions of this file are
 ** made subject to an alternative license as permitted in the SGI Free
 ** Software License B, Version 2.0 (the "License"), the contents of this
 ** file are subject only to the provisions of the License. You may not use
 ** this file except in compliance with the License. You may obtain a copy
 ** of the License at Silicon Graphics, Inc., attn: Legal Services, 1600
 ** Amphitheatre Parkway, Mountain View, CA 94043-1351, or at:
 **
 ** http://oss.sgi.com/projects/FreeB
 **
 ** Note that, as provided in the License, the Software is distributed on an
 ** "AS IS" basis, with ALL EXPRESS AND IMPLIED WARRANTIES AND CONDITIONS
 ** DISCLAIMED, INCLUDING, WITHOUT LIMITATION, ANY IMPLIED WARRANTIES AND
 ** CONDITIONS OF MERCHANTABILITY, SATISFACTORY QUALITY, FITNESS FOR A
 ** PARTICULAR PURPOSE, AND NON-INFRINGEMENT.
 **
 ** Original Code. The Original Code is: OpenGL Sample Implementation,
 ** Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
 ** Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
 ** Copyright in any portions created by third parties is as indicated
 ** elsewhere herein. All Rights Reserved.
 **
 ** Additional Notice Provisions: The application programming interfaces
 ** established by SGI in conjunction with the Original Code are The
 ** OpenGL(R) Graphics System: A Specification (Version 1.2.1), released
 ** April 1, 1999; The OpenGL(R) Graphics System Utility Library (Version
 ** 1.3), released November 4, 1998; and OpenGL(R) Graphics with the X
 ** Window System(R) (Version 1.3), released October 19, 1998. This software
 ** was created using the OpenGL(R) version 1.2.1 Sample Implementation
 ** published by SGI, but has not been independently verified as being
 ** compliant with the OpenGL(R) version 1.2.1 Specification.
 */

/**
 * Class holding curve definition
 * @author Tomáš Hráský
 *
 */
public class Curve {

  /**
   * Maximum coordinates per control point
   */
  private static final int MAXCOORDS = 5;

  /**
   * Max curve order
   */
  private static final int MAXORDER = 24;

  /**
   * Next curve in linked list
   */
  public Curve next;

  /**
   * OpenGL maps
   */
  private final Mapdesc mapdesc;

  /**
   * Does the curve need sampling
   */
  private final boolean needsSampling;

  /**
   * Culling
   */
  private final int cullval;

  /**
   * Number of coords
   */
  private final int stride;

  /**
   * Curve order
   */
  private final int order;

  /**
   * Holds conversion range borders
   */
  private final float[] range;

  /**
   * Subdivision stepsize
   */
  public float stepsize;

  /**
   * Minimal subdivision stepsize
   */
  private float minstepsize;

  /**
   * Sampling points
   */
  float[] spts;

  /**
   * Makes new Curve
   *
   * @param geo
   * @param pta
   * @param ptb
   * @param c
   *            next curve in linked list
   */
  public Curve(final Quilt geo, final float[] pta, final float[] ptb, final Curve c) {

    spts = new float[MAXORDER * MAXCOORDS];

    mapdesc = geo.mapdesc;

    next = c;
    needsSampling = mapdesc.isRangeSampling() ? true : false;

    cullval = mapdesc.isCulling() ? Subdivider.CULL_ACCEPT
      : Subdivider.CULL_TRIVIAL_REJECT;
    order = geo.qspec.get(0).order;
    stride = MAXCOORDS;

    // CArrayOfFloats ps = geo.cpts;
    final CArrayOfFloats ps = new CArrayOfFloats(geo.cpts.getArray(), 0);
    final CArrayOfQuiltspecs qs = geo.qspec;
    ps.raisePointerBy(qs.get().offset);
    ps.raisePointerBy(qs.get().index * qs.get().order * qs.get().stride);

    if (needsSampling) {
      mapdesc.xformSampling(ps, qs.get().order, qs.get().stride, spts,
                            stride);
    }
    if (cullval == Subdivider.CULL_ACCEPT) {
      //                System.out.println("TODO curve.Curve-cullval");
      // mapdesc.xformCulling(ps,qs.get().order,qs.get().stride,cpts,stride);
    }

    range = new float[3];
    range[0] = qs.get().breakpoints[qs.get().index];
    range[1] = qs.get().breakpoints[qs.get().index + 1];
    range[2] = range[1] - range[0];
    // TODO it is necessary to solve problem with "this" pointer here
    if (range[0] != pta[0]) {
      //                System.out.println("TODO curve.Curve-range0");
      // Curve lower=new Curve(this,pta,0);
      // lower.next=next;
      // this=lower;
    }
    if (range[1] != ptb[0]) {
      //                System.out.println("TODO curve.Curve-range1");
      // Curve lower=new Curve(this,ptb,0);
    }
  }

  /**
   * Checks culling type
   * @return Subdivider.CULL_ACCEPT
   */
  public int cullCheck() {
    if (cullval == Subdivider.CULL_ACCEPT) {
      //                System.out.println("TODO curve.cullval");
      // cullval=mapdesc.cullCheck(cpts,order,stride);
    }
    // TODO compute cullval and return the computed value
    // return cullval;
    return Subdivider.CULL_ACCEPT;
  }

  /**
   * Computes subdivision step size
   */
  public void getStepSize() {
    minstepsize = 0;
    if (mapdesc.isConstantSampling()) {
      setstepsize(mapdesc.maxrate);
    } else if (mapdesc.isDomainSampling()) {
      setstepsize(mapdesc.maxrate * range[2]);
    } else {
      assert (order <= MAXORDER);

      setstepsize(mapdesc.maxrate);

      /***
          final float tmp[][] = new float[MAXORDER][MAXCOORDS];

          final int tstride = (MAXORDER);

          final int val = 0;
          // mapdesc.project(spts,stride,tmp,tstride,order);

          //                System.out.println("TODO curve.getsptepsize mapdesc.project");

          if (val == 0) {
            setstepsize(mapdesc.maxrate);
          } else {
            final float t = mapdesc.getProperty(NurbsConsts.N_PIXEL_TOLERANCE);
            if (mapdesc.isParametricDistanceSampling()) {
              //                        System.out.println("TODO curve.getstepsize - parametric");
            } else if (mapdesc.isPathLengthSampling()) {
              //                        System.out.println("TODO curve.getstepsize - pathlength");
            } else {
              setstepsize(mapdesc.maxrate);
            }
          }
      */

    }

  }

  /**
   * Sets maximum subdivision step size
   * @param max maximum subdivision step size
   */
  private void setstepsize(final float max) {
    // DONE
    stepsize = (max >= 1) ? (range[2] / max) : range[2];
    minstepsize = stepsize;
  }

  /**
   * Clamps the curve
   */
  public void clamp() {
    // DONE
    if (stepsize < minstepsize)
      stepsize = mapdesc.clampfactor * minstepsize;
  }

  /**
   * Tells whether curve needs subdivision
   *
   * @return curve needs subdivison
   */
  public boolean needsSamplingSubdivision() {
    return (stepsize < minstepsize);
  }
}