FreeWRL / FreeX3D 4.3.0
gridWrap.h
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#ifdef __unix__
33# define _glu_dprintf printf
34#endif
35
36#ifndef _GRIDWRAP_H
37#define _GRIDWRAP_H
38
39#include <stdio.h>
40#include "definitions.h"
41
42#include "primitiveStream.h"
43#include "zlassert.h"
44
45class gridWrap{
46 Int n_ulines;
47 Int n_vlines;
48 Real u_min, u_max;
49 Real v_min, v_max;
50
51 /*cache the coordinate values for efficiency.
52 *these are redundant information when
53 *the grid is uniform.
54 */
55 Real* u_values; /*size is n_ulines*/
56 Real* v_values; /*size is n_vlines*/
57
58 Int is_uniform;
59
60public:
61 //uniform grid constructor
62 gridWrap(Int nUlines, Int nVlines,
63 Real uMin, Real uMax,
64 Real vMin, Real vMax
65 );
66
67 //nonuniform grid constructor.
68 gridWrap(Int nUlines, Real *uvals,
69 Int nVlines, Real *vvlas
70 );
71 ~gridWrap();
72
73 void print();
74 Int get_n_ulines() {return n_ulines;}
75 Int get_n_vlines() {return n_vlines;}
76 Real get_u_min() {return u_min;}
77 Real get_u_max() {return u_max;}
78 Real get_v_min() {return v_min;}
79 Real get_v_max() {return v_max;}
80
81 Real get_u_value(Int i)
82 {
83 assert(i<n_ulines);
84 /*if(i>=n_ulines){printf("ERROR, n_ulines=%i,i=%i\n",n_ulines,i);exit(0);}*/
85 return u_values[i];}
86 Real get_v_value(Int j) {return v_values[j];}
87
88 Real* get_u_values() {return u_values;}
89 Real* get_v_values() {return v_values;}
90
91 void outputFanWithPoint(Int v, Int uleft, Int uright,
92 Real vert[2], primStream* pStream);
93
94 void draw();
95
96 Int isUniform() {return is_uniform;}
97};
98
99class gridBoundaryChain{
100 gridWrap* grid;
101 Int firstVlineIndex;
102 Int nVlines;
103 Int* ulineIndices; /*each v line has a boundary*/
104 Int* innerIndices; /*the segment of the vertical gridline from */
105 /*(innerIndices[i], i) to (innerIndices[i+1], i-1) */
106 /*is inside the polygon: i=1,...,nVlines-1*/
107
108 Real2* vertices; /*one grid point at each grid V-line, cached for efficiency*/
109
110public:
111 gridBoundaryChain(gridWrap* gr, Int first_vline_index, Int n_vlines, Int* uline_indices, Int* inner_indices);
112
113 ~gridBoundaryChain()
114 {
115 free(innerIndices);
116 free(ulineIndices);
117 free(vertices);
118 }
119
120 /*i indexes the vlines in this chain.
121 */
122 Int getVlineIndex(Int i) {return firstVlineIndex-i;}
123 Int getUlineIndex(Int i) {return ulineIndices[i];}
124 Real get_u_value(Int i) {return vertices[i][0];}
125 Real get_v_value(Int i) {return vertices[i][1];}
126 Int get_nVlines() {return nVlines;}
127 Int getInnerIndex(Int i) {return innerIndices[i];}
128 Real getInner_u_value(Int i) {return grid->get_u_value(innerIndices[i]);}
129
130 Real* get_vertex(Int i) {return vertices[i];}
131 gridWrap* getGrid() {return grid;}
132 void leftEndFan(Int i, primStream* pStream);
133 void rightEndFan(Int i, primStream* pStream);
134
135 Int lookfor(Real v, Int i1, Int i2); //find i in [i1,i2] so that vertices[i][1]>= v > vertices[i+1][1]
136 void draw();
137 void drawInner();
138};
139
140#endif