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 * arcsorter.c++
37 *
38 */
39
40 #ifndef __gluarcsorter_c_
41 #define __gluarcsorter_c_
42
43 //#include "glimports.h"
44 //#include "arc.h"
45 #include "arcsorter.h"
46 #include "subdivider.h"
47
ArcSorter(Subdivider & s)48 ArcSorter::ArcSorter(Subdivider &s) : Sorter( sizeof( Arc ** ) ), subdivider(s)
49 {
50 }
51
52 int
qscmp(char *,char *)53 ArcSorter::qscmp( char *, char * )
54 {
55 _glu_dprintf( "ArcSorter::qscmp: pure virtual called\n" );
56 return 0;
57 }
58
59 void
qsort(Arc ** a,int n)60 ArcSorter::qsort( Arc **a, int n )
61 {
62 Sorter::qsort( (void *) a, n );
63 }
64
65 void
qsexc(char * i,char * j)66 ArcSorter::qsexc( char *i, char *j )// i<-j, j<-i
67 {
68 Arc **jarc1 = (Arc **) i;
69 Arc **jarc2 = (Arc **) j;
70 Arc *tmp = *jarc1;
71 *jarc1 = *jarc2;
72 *jarc2 = tmp;
73 }
74
75 void
qstexc(char * i,char * j,char * k)76 ArcSorter::qstexc( char *i, char *j, char *k )// i<-k, k<-j, j<-i
77 {
78 Arc **jarc1 = (Arc **) i;
79 Arc **jarc2 = (Arc **) j;
80 Arc **jarc3 = (Arc **) k;
81 Arc *tmp = *jarc1;
82 *jarc1 = *jarc3;
83 *jarc3 = *jarc2;
84 *jarc2 = tmp;
85 }
86
87
ArcSdirSorter(Subdivider & s)88 ArcSdirSorter::ArcSdirSorter( Subdivider &s ) : ArcSorter(s)
89 {
90 }
91
92 int
qscmp(char * i,char * j)93 ArcSdirSorter::qscmp( char *i, char *j )
94 {
95 Arc *jarc1 = *(Arc **) i;
96 Arc *jarc2 = *(Arc **) j;
97
98 int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
99 int v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
100
101 REAL diff = jarc1->pwlArc->pts[v1].param[1] -
102 jarc2->pwlArc->pts[v2].param[1];
103
104 if( diff < 0.0)
105 return -1;
106 else if( diff > 0.0)
107 return 1;
108 else {
109 if( v1 == 0 ) {
110 if( jarc2->tail()[0] < jarc1->tail()[0] ) {
111 return subdivider.ccwTurn_sl( jarc2, jarc1 ) ? 1 : -1;
112 } else {
113 return subdivider.ccwTurn_sr( jarc2, jarc1 ) ? -1 : 1;
114 }
115 } else {
116 if( jarc2->head()[0] < jarc1->head()[0] ) {
117 return subdivider.ccwTurn_sl( jarc1, jarc2 ) ? -1 : 1;
118 } else {
119 return subdivider.ccwTurn_sr( jarc1, jarc2 ) ? 1 : -1;
120 }
121 }
122 }
123 }
124
ArcTdirSorter(Subdivider & s)125 ArcTdirSorter::ArcTdirSorter( Subdivider &s ) : ArcSorter(s)
126 {
127 }
128
129 /*----------------------------------------------------------------------------
130 * ArcTdirSorter::qscmp -
131 * compare two axis monotone arcs that are incident
132 * to the line T == compare_value. Determine which of the
133 * two intersects that line with a LESSER S value. If
134 * jarc1 does, return 1. If jarc2 does, return -1.
135 *----------------------------------------------------------------------------
136 */
137 int
qscmp(char * i,char * j)138 ArcTdirSorter::qscmp( char *i, char *j )
139 {
140 Arc *jarc1 = *(Arc **) i;
141 Arc *jarc2 = *(Arc **) j;
142
143 int v1 = (jarc1->getitail() ? 0 : (jarc1->pwlArc->npts - 1));
144 int v2 = (jarc2->getitail() ? 0 : (jarc2->pwlArc->npts - 1));
145
146 REAL diff = jarc1->pwlArc->pts[v1].param[0] -
147 jarc2->pwlArc->pts[v2].param[0];
148
149 if( diff < 0.0)
150 return 1;
151 else if( diff > 0.0)
152 return -1;
153 else {
154 if( v1 == 0 ) {
155 if (jarc2->tail()[1] < jarc1->tail()[1]) {
156 return subdivider.ccwTurn_tl( jarc2, jarc1 ) ? 1 : -1;
157 } else {
158 return subdivider.ccwTurn_tr( jarc2, jarc1 ) ? -1 : 1;
159 }
160 } else {
161 if( jarc2->head()[1] < jarc1->head()[1] ) {
162 return subdivider.ccwTurn_tl( jarc1, jarc2 ) ? -1 : 1;
163 } else {
164 return subdivider.ccwTurn_tr( jarc1, jarc2 ) ? 1 : -1;
165 }
166 }
167 }
168 }
169
170
171
172 #endif /* __gluarcsorter_c_ */
173