1/*
2 * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
3 * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
4 *
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
11 *
12 * The above copyright notice including the dates of first publication and
13 * either this permission notice or a reference to
14 * http://oss.sgi.com/projects/FreeB/
15 * shall be included in all copies or substantial portions of the Software.
16 *
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
21 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
22 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23 * SOFTWARE.
24 *
25 * Except as contained in this notice, the name of Silicon Graphics, Inc.
26 * shall not be used in advertising or otherwise to promote the sale, use or
27 * other dealings in this Software without prior written authorization from
28 * Silicon Graphics, Inc.
29 */
30/*
31*/
32
33#ifndef _BEZIERPATCH_H
34#define _BEZIERPATCH_H
35
36typedef struct bezierPatch{
37  float umin, vmin, umax, vmax;
38  int uorder; /*order= degree + 1*/
39  int vorder;
40
41  /*
42   *the control points are stored in a one dimensional  array.
43   *the surface is defined as:
44   *      s(u,v) = sum_{i,j} P(i,j) * B_i(u) * B_j(v).
45   *where P(i,j) are the control points, B_i(.) are Bezier
46   *basis functions.
47   *Each control point can have dimension 3 or 4: (x,y,z,w).
48   *The components of P(i,j) are stored in a one dimensional
49   *array:
50   *       ctlpoints[]
51   *in the order of:
52   * P[0,0], P[0,1], ..., P[0,vorder-1],
53   * P[1,0], P[1,1], ..., P[1,vorder-1],
54   *  ...
55   * P[uorder-1,0], P[uorder-1,1], ..., P[uorder-1,vorder-1].
56   */
57  int dimension;
58  float* ctlpoints;
59
60  /*
61   *in case we have to manage multiple bezierPatches.
62   */
63  struct bezierPatch  *next;
64
65} bezierPatch;
66
67#ifdef __cplusplus
68extern "C" {
69#endif
70
71bezierPatch* bezierPatchMake(float umin, float vmin, float umax, float vmax, int urder, int vorder, int dimension);
72
73bezierPatch* bezierPatchMake2(float umin, float vmin, float umax, float vmax, int urder, int vorder, int dimension, int ustride, int vstride, float *ctlpoints);
74
75
76bezierPatch* bezierPatchInsert(bezierPatch *list, bezierPatch *b);
77
78void bezierPatchDelete(bezierPatch *b);
79
80void bezierPatchDeleteList(bezierPatch *b);
81
82void bezierPatchPrint(bezierPatch *b);
83
84void bezierPatchPrintList(bezierPatch *list);
85
86void bezierPatchEval(bezierPatch *b, float u, float v, float ret[]);
87
88void bezierPatchEvalNormal(bezierPatch *b, float u, float v, float retNormal[]);
89
90void bezierPatchEval(bezierPatch *b, float u, float v, float ret[]);
91
92void bezierPatchEvalNormal(bezierPatch *b, float u, float v, float ret[]);
93
94
95void bezierPatchDraw(bezierPatch *bpatch, int u_reso, int v_reso);
96
97void bezierPatchListDraw(bezierPatch *list, int u_reso, int v_reso);
98
99#ifdef __cplusplus
100}
101#endif
102
103
104#endif
105