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
|
#include <u.h>
#include <libc.h>
#include <thread.h>
#include <draw.h>
#include <memdraw.h>
#include <geometry.h>
#include "libobj/obj.h"
#include "graphics.h"
#include "internal.h"
enum {
CLIPL = 1,
CLIPR = 2,
CLIPT = 4,
CLIPB = 8,
};
static void
mulsdm(double r[6], double m[6][4], Point3 p)
{
int i;
for(i = 0; i < 6; i++)
r[i] = m[i][0]*p.x + m[i][1]*p.y + m[i][2]*p.z + m[i][3]*p.w;
}
static int
addvert(Polygon *p, Vertex v)
{
if(++p->n > p->cap)
p->v = erealloc(p->v, (p->cap = p->n)*sizeof(*p->v));
p->v[p->n-1] = v;
return p->n;
}
static void
swappoly(Polygon **a, Polygon **b)
{
Polygon *tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
static void
cleanpoly(Polygon *p)
{
int i;
for(i = 0; i < p->n; i++)
delvattrs(&p->v[i]);
p->n = 0;
}
static void
fprintpoly(int fd, Polygon *p)
{
int i;
for(i = 0; i < p->n; i++)
fprint(fd, "%d/%lud p %V\n", i, p->n, p->v[i].p);
}
static int
eqpt3(Point3 a, Point3 b)
{
return vec3len(subpt3(a, b)) < 1e-6;
}
/*
* references:
* - “Clipping Using Homogeneous Coordinates”, James F. Blinn, Martin E. Newell, SIGGRAPH '78, pp. 245-251
* - https://cs418.cs.illinois.edu/website/text/clipping.html
* - https://github.com/aap/librw/blob/14dab85dcae6f3762fb2b1eda4d58d8e67541330/tools/playground/tl_tests.cpp#L522
*/
int
clipprimitive(Primitive *p)
{
/* signed distance from each clipping plane */
static double sdm[6][4] = {
1, 0, 0, 1, /* l */
-1, 0, 0, 1, /* r */
0, 1, 0, 1, /* b */
0, -1, 0, 1, /* t */
0, 0, 1, 1, /* f */
0, 0, -1, 1, /* n */
};
double sd0[6], sd1[6];
double d0, d1, perc;
Polygon Vinp, Voutp, *Vin, *Vout;
Vertex *v0, *v1, v; /* edge verts and new vertex (line-plane intersection) */
int i, j, np;
np = 0;
Vin = &Vinp;
Vout = &Voutp;
memset(Vin, 0, sizeof Vinp);
memset(Vout, 0, sizeof Voutp);
for(i = 0; i < p[0].type+1; i++)
addvert(Vin, p[0].v[i]);
for(j = 0; j < 6 && Vin->n > 0; j++){
for(i = 0; i < Vin->n; i++){
v0 = &Vin->v[i];
v1 = &Vin->v[(i+1) % Vin->n];
mulsdm(sd0, sdm, v0->p);
mulsdm(sd1, sdm, v1->p);
if(sd0[j] < 0 && sd1[j] < 0)
continue;
if(sd0[j] >= 0 && sd1[j] >= 0)
goto allin;
d0 = (j&1) == 0? sd0[j]: -sd0[j];
d1 = (j&1) == 0? sd1[j]: -sd1[j];
perc = d0/(d0 - d1);
lerpvertex(&v, v0, v1, perc);
addvert(Vout, v);
if(sd1[j] >= 0){
allin:
addvert(Vout, dupvertex(v1));
}
}
cleanpoly(Vin);
if(j < 6-1)
swappoly(&Vin, &Vout);
}
if(Vout->n < 2)
cleanpoly(Vout);
else switch(p[0].type){
case PLine:
p[0].v[0] = dupvertex(&Vout->v[0]);
p[0].v[1] = eqpt3(Vout->v[0].p, Vout->v[1].p)? dupvertex(&Vout->v[2]): dupvertex(&Vout->v[1]);
cleanpoly(Vout);
np = 1;
break;
case PTriangle:
/* triangulate */
for(i = 0; i < Vout->n-2; i++, np++){
/*
* when performing fan triangulation, indices 0 and 2
* are referenced on every triangle, so duplicate them
* to avoid complications during rasterization.
*/
p[np] = p[0];
p[np].v[0] = i < Vout->n-2-1? dupvertex(&Vout->v[0]): Vout->v[0];
p[np].v[1] = Vout->v[i+1];
p[np].v[2] = i < Vout->n-2-1? dupvertex(&Vout->v[i+2]): Vout->v[i+2];
}
break;
}
free(Vout->v);
free(Vin->v);
return np;
}
static int
ptisinside(int code)
{
return !code;
}
static int
lineisinside(int code0, int code1)
{
return !(code0|code1);
}
static int
lineisoutside(int code0, int code1)
{
return code0 & code1;
}
static int
outcode(Point p, Rectangle r)
{
int code;
code = 0;
if(p.x < r.min.x) code |= CLIPL;
if(p.x > r.max.x) code |= CLIPR;
if(p.y < r.min.y) code |= CLIPT;
if(p.y > r.max.y) code |= CLIPB;
return code;
}
/*
* Cohen-Sutherland rectangle-line clipping
*/
int
rectclipline(Rectangle r, Point *p0, Point *p1)
{
int code0, code1;
int Δx, Δy;
double m;
Δx = p1->x - p0->x;
Δy = p1->y - p0->y;
m = Δx == 0? 0: (double)Δy/Δx;
for(;;){
code0 = outcode(*p0, r);
code1 = outcode(*p1, r);
if(lineisinside(code0, code1))
return 0;
else if(lineisoutside(code0, code1))
return -1;
if(ptisinside(code0)){
swappt(p0, p1);
swapi(&code0, &code1);
}
if(code0 & CLIPL){
p0->y += (r.min.x - p0->x)*m;
p0->x = r.min.x;
}else if(code0 & CLIPR){
p0->y += (r.max.x - p0->x)*m;
p0->x = r.max.x;
}else if(code0 & CLIPT){
if(p0->x != p1->x && m != 0)
p0->x += (r.min.y - p0->y)/m;
p0->y = r.min.y;
}else if(code0 & CLIPB){
if(p0->x != p1->x && m != 0)
p0->x += (r.max.y - p0->y)/m;
p0->y = r.max.y;
}
}
}
|
