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
|
/*
** 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 1.1 (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.
*/
/*
* subdivider.h
*
* $Date: 2001/08/07 17:34:11 $ $Revision: 1.2 $
* $Header: /home/krh/git/sync/mesa-cvs-repo/Mesa/src/glu/sgi/libnurbs/internals/subdivider.h,v 1.2 2001/08/07 17:34:11 brianp Exp $
*/
#ifndef __glusubdivider_h_
#define __glusubdivider_h_
#include "mysetjmp.h"
#include "bin.h"
#include "flist.h"
#include "slicer.h"
#include "arctess.h"
#include "trimvertex.h"
#include "trimvertpool.h"
class Arc;
class Pool;
class Renderhints;
class Quilt;
class Patchlist;
class Curvelist;
struct JumpBuffer;
class Subdivider {
public:
Subdivider( Renderhints&, Backend& );
~Subdivider( void );
void clear( void );
void beginTrims( void ) {}
void beginLoop( void );
void addArc( REAL *, Quilt *, long );
void addArc( int, TrimVertex *, long );
void endLoop( void ) {}
void endTrims( void ) {}
void beginQuilts( void );
void addQuilt( Quilt * );
void endQuilts( void ) {}
void drawCurves( void );
void drawSurfaces( long );
int ccwTurn_sl( Arc_ptr, Arc_ptr );
int ccwTurn_sr( Arc_ptr , Arc_ptr );
int ccwTurn_tl( Arc_ptr , Arc_ptr );
int ccwTurn_tr( Arc_ptr , Arc_ptr );
void setJumpbuffer( JumpBuffer * );
void set_domain_distance_u_rate(REAL u_rate)
{
domain_distance_u_rate = u_rate;
}
void set_domain_distance_v_rate(REAL v_rate)
{
domain_distance_v_rate = v_rate;
}
void set_is_domain_distance_sampling(int flag)
{
is_domain_distance_sampling = flag;
}
private:
void classify_headonleft_s( Bin &, Bin &, Bin &, REAL );
void classify_tailonleft_s( Bin &, Bin &, Bin &, REAL );
void classify_headonright_s( Bin &, Bin &, Bin &, REAL );
void classify_tailonright_s( Bin &, Bin &, Bin &, REAL );
void classify_headonleft_t( Bin &, Bin &, Bin &, REAL );
void classify_tailonleft_t( Bin &, Bin &, Bin &, REAL );
void classify_headonright_t( Bin &, Bin &, Bin &, REAL );
void classify_tailonright_t( Bin &, Bin &, Bin &, REAL );
enum dir { down, same, up, none };
void tessellate( Arc_ptr, REAL );
void monotonize( Arc_ptr , Bin & );
int isMonotone( Arc_ptr );
int decompose( Bin &, REAL );
Slicer slicer;
ArcTessellator arctessellator;
Pool arcpool;
Pool bezierarcpool;
Pool pwlarcpool;
TrimVertexPool trimvertexpool;
JumpBuffer* jumpbuffer;
Renderhints& renderhints;
Backend& backend;
Bin initialbin;
Arc_ptr pjarc;
int s_index;
int t_index;
Quilt * qlist;
Flist spbrkpts;
Flist tpbrkpts;
Flist smbrkpts;
Flist tmbrkpts;
REAL stepsizes[4];
int showDegenerate;
int isArcTypeBezier;
void samplingSplit( Curvelist&, int );
void subdivideInS( Bin& );
void splitInS( Bin&, int, int );
void splitInT( Bin&, int, int );
void samplingSplit( Bin&, Patchlist&, int, int );
void nonSamplingSplit( Bin&, Patchlist&, int, int );
void tessellation( Bin&, Patchlist& );
void monosplitInS( Bin&, int, int );
void monosplitInT( Bin&, int, int );
void outline( Bin & );
void freejarcs( Bin & );
void render( Bin & );
void split( Bin &, Bin &, Bin &, int, REAL );
void tessellate( Bin &, REAL, REAL, REAL, REAL );
inline void setDegenerate( void ) { showDegenerate = 1; }
inline void setNonDegenerate( void ) { showDegenerate = 0; }
inline int showingDegenerate( void ) { return showDegenerate; }
inline void setArcTypeBezier( void ) { isArcTypeBezier = 1; }
inline void setArcTypePwl( void ) { isArcTypeBezier = 0; }
inline int isBezierArcType( void ) { return isArcTypeBezier; }
void makeBorderTrim( const REAL *, const REAL * );
void split( Bin &, int, const REAL *, int, int );
void partition( Bin &, Bin &, Bin &, Bin &, Bin &, int, REAL );
void findIrregularS( Bin & );
void findIrregularT( Bin & );
inline int bbox( TrimVertex *, TrimVertex *, TrimVertex *, int );
static int bbox( REAL, REAL, REAL, REAL, REAL, REAL );
static int ccw( TrimVertex *, TrimVertex *, TrimVertex * );
void join_s( Bin &, Bin &, Arc_ptr, Arc_ptr );
void join_t( Bin &, Bin &, Arc_ptr , Arc_ptr );
int arc_split( Arc_ptr , int, REAL, int );
void check_s( Arc_ptr , Arc_ptr );
void check_t( Arc_ptr , Arc_ptr );
inline void link( Arc_ptr , Arc_ptr , Arc_ptr , Arc_ptr );
inline void simple_link( Arc_ptr , Arc_ptr );
Bin* makePatchBoundary( const REAL *from, const REAL *to );
/*in domain distance method, the tessellation is controled by two numbers:
*GLU_U_STEP: number of u-segments per unit u length of domain
*GLU_V_STEP: number of v-segments per unit v length of domain
*These two numbers are normally stored in mapdesc->maxs(t)rate.
*I (ZL) put these two numbers here so that I can optimize the untrimmed
*case in the case of domain distance sampling.
*These two numbers are set by set_domain_distance_u_rate() and ..._v_..().
*/
REAL domain_distance_u_rate;
REAL domain_distance_v_rate;
int is_domain_distance_sampling;
};
inline void
Subdivider::beginLoop( void )
{
pjarc = 0;
}
#endif /* __glusubdivider_h_ */
|
