2 THE COMPUTER CODE CONTAINED HEREIN IS THE SOLE PROPERTY OF PARALLAX
3 SOFTWARE CORPORATION ("PARALLAX"). PARALLAX, IN DISTRIBUTING THE CODE TO
4 END-USERS, AND SUBJECT TO ALL OF THE TERMS AND CONDITIONS HEREIN, GRANTS A
5 ROYALTY-FREE, PERPETUAL LICENSE TO SUCH END-USERS FOR USE BY SUCH END-USERS
6 IN USING, DISPLAYING, AND CREATING DERIVATIVE WORKS THEREOF, SO LONG AS
7 SUCH USE, DISPLAY OR CREATION IS FOR NON-COMMERCIAL, ROYALTY OR REVENUE
8 FREE PURPOSES. IN NO EVENT SHALL THE END-USER USE THE COMPUTER CODE
9 CONTAINED HEREIN FOR REVENUE-BEARING PURPOSES. THE END-USER UNDERSTANDS
10 AND AGREES TO THE TERMS HEREIN AND ACCEPTS THE SAME BY USE OF THIS FILE.
11 COPYRIGHT 1993-1998 PARALLAX SOFTWARE CORPORATION. ALL RIGHTS RESERVED.
16 * Functions for sizing segments
37 #define MAX_MODIFIED_VERTICES 32
38 int Modified_vertices[MAX_MODIFIED_VERTICES];
39 int Modified_vertex_index = 0;
41 // ------------------------------------------------------------------------------------------
42 void validate_modified_segments(void)
45 char modified_segments[MAX_SEGMENTS];
47 for (v=0; v<=Highest_segment_index; v++)
48 modified_segments[v] = 0;
50 for (v=0; v<Modified_vertex_index; v++) {
51 v0 = Modified_vertices[v];
53 for (seg = 0; seg <= Highest_segment_index; seg++) {
54 short *vp = Segments[seg].verts;
55 if (Segments[seg].segnum != -1)
56 for (w=0; w<MAX_VERTICES_PER_SEGMENT; w++)
58 modified_segments[seg] = 1;
62 for (v=0; v<=Highest_segment_index; v++)
63 if (modified_segments[v]) {
66 // mprintf(0, "Validating segment #%04i\n", v);
67 validate_segment(&Segments[v]);
68 for (s=0; s<MAX_SIDES_PER_SEGMENT; s++) {
70 assign_default_uvs_to_side(&Segments[v], s);
75 // ------------------------------------------------------------------------------------------
76 // Scale vertex *vertp by vector *vp, scaled by scale factor scale_factor
77 void scale_vert_aux(int vertex_ind, vms_vector *vp, fix scale_factor)
79 vms_vector *vertp = &Vertices[vertex_ind];
81 vertp->x += fixmul(vp->x,scale_factor)/2;
82 vertp->y += fixmul(vp->y,scale_factor)/2;
83 vertp->z += fixmul(vp->z,scale_factor)/2;
85 Assert(Modified_vertex_index < MAX_MODIFIED_VERTICES);
86 Modified_vertices[Modified_vertex_index++] = vertex_ind;
89 // ------------------------------------------------------------------------------------------
90 void scale_vert(segment *sp, int vertex_ind, vms_vector *vp, fix scale_factor)
92 switch (SegSizeMode) {
93 case SEGSIZEMODE_FREE:
94 if (is_free_vertex(vertex_ind))
95 scale_vert_aux(vertex_ind, vp, scale_factor);
98 scale_vert_aux(vertex_ind, vp, scale_factor);
100 case SEGSIZEMODE_CURSIDE: {
103 if (sp->verts[Side_to_verts[Curside][v]] == vertex_ind)
104 scale_vert_aux(vertex_ind, vp, scale_factor);
107 case SEGSIZEMODE_EDGE: {
111 if (sp->verts[Side_to_verts[Curside][(Curedge+v)%4]] == vertex_ind)
112 scale_vert_aux(vertex_ind, vp, scale_factor);
115 case SEGSIZEMODE_VERTEX:
116 if (sp->verts[Side_to_verts[Curside][Curvert]] == vertex_ind)
117 scale_vert_aux(vertex_ind, vp, scale_factor);
120 Error("Unsupported SegSizeMode in ksegsize.c/scale_vert = %i\n", SegSizeMode);
125 // ------------------------------------------------------------------------------------------
126 void scale_free_verts(segment *sp, vms_vector *vp, int side, fix scale_factor)
132 verts = Side_to_verts[side];
134 for (v=0; v<4; v++) {
135 vertex_ind = sp->verts[(int) verts[v]];
136 if (SegSizeMode || is_free_vertex(vertex_ind))
137 scale_vert(sp, vertex_ind, vp, scale_factor);
143 // -----------------------------------------------------------------------------
144 // Make segment *sp bigger in dimension dimension by amount amount.
145 void med_scale_segment_new(segment *sp, int dimension, fix amount)
149 Modified_vertex_index = 0;
151 med_extract_matrix_from_segment(sp, &mat);
155 scale_free_verts(sp, &mat.rvec, WLEFT, -amount);
156 scale_free_verts(sp, &mat.rvec, WRIGHT, +amount);
159 scale_free_verts(sp, &mat.uvec, WBOTTOM, -amount);
160 scale_free_verts(sp, &mat.uvec, WTOP, +amount);
163 scale_free_verts(sp, &mat.fvec, WFRONT, -amount);
164 scale_free_verts(sp, &mat.fvec, WBACK, +amount);
168 validate_modified_segments();
171 // ------------------------------------------------------------------------------------------
172 // Extract a vector from a segment. The vector goes from the start face to the end face.
173 // The point on each face is the average of the four points forming the face.
174 void extract_vector_from_segment_side(segment *sp, int side, vms_vector *vp, int vla, int vlb, int vra, int vrb)
178 vm_vec_sub(&v1,&Vertices[sp->verts[Side_to_verts[side][vra]]],&Vertices[sp->verts[Side_to_verts[side][vla]]]);
179 vm_vec_sub(&v2,&Vertices[sp->verts[Side_to_verts[side][vrb]]],&Vertices[sp->verts[Side_to_verts[side][vlb]]]);
180 vm_vec_add(vp, &v1, &v2);
182 vm_vec_scale(vp, F1_0/2);
185 // ------------------------------------------------------------------------------------------
186 // Extract the right vector from segment *sp, return in *vp.
187 // The forward vector is defined to be the vector from the the center of the left face of the segment
188 // to the center of the right face of the segment.
189 void med_extract_right_vector_from_segment_side(segment *sp, int sidenum, vms_vector *vp)
191 extract_vector_from_segment_side(sp, sidenum, vp, 3, 2, 0, 1);
194 // ------------------------------------------------------------------------------------------
195 // Extract the up vector from segment *sp, return in *vp.
196 // The forward vector is defined to be the vector from the the center of the bottom face of the segment
197 // to the center of the top face of the segment.
198 void med_extract_up_vector_from_segment_side(segment *sp, int sidenum, vms_vector *vp)
200 extract_vector_from_segment_side(sp, sidenum, vp, 1, 2, 0, 3);
204 // -----------------------------------------------------------------------------
205 // Increase the size of Cursegp in dimension dimension by amount
206 int segsize_common(int dimension, fix amount)
209 int propagated[MAX_SIDES_PER_SEGMENT];
210 vms_vector uvec, rvec, fvec, scalevec;
212 Degenerate_segment_found = 0;
214 med_scale_segment_new(Cursegp, dimension, amount);
216 med_extract_up_vector_from_segment_side(Cursegp, Curside, &uvec);
217 med_extract_right_vector_from_segment_side(Cursegp, Curside, &rvec);
218 extract_forward_vector_from_segment(Cursegp, &fvec);
220 scalevec.x = vm_vec_mag(&rvec);
221 scalevec.y = vm_vec_mag(&uvec);
222 scalevec.z = vm_vec_mag(&fvec);
224 if (Degenerate_segment_found) {
225 Degenerate_segment_found = 0;
226 // mprintf(0, "Applying scale would create degenerate segments. Aborting scale.\n");
227 editor_status("Applying scale would create degenerate segments. Aborting scale.");
228 med_scale_segment_new(Cursegp, dimension, -amount);
232 med_create_new_segment(&scalevec);
234 // For all segments to which Cursegp is connected, propagate tmap (uv coordinates) from the connected
235 // segment back to Cursegp. This will meaningfully propagate uv coordinates to all sides which havve
236 // an incident edge. It will also do some sides more than once. And it is probably just not what you want.
237 for (i=0; i<MAX_SIDES_PER_SEGMENT; i++)
240 for (i=0; i<MAX_SIDES_PER_SEGMENT; i++)
241 if (IS_CHILD(Cursegp->children[i])) {
243 for (s=0; s<MAX_SIDES_PER_SEGMENT; s++)
245 propagated[(int) Side_opposite[i]]--;
246 med_propagate_tmaps_to_segments(&Segments[Cursegp->children[i]],Cursegp,1);
249 // Now, for all sides that were not adjacent to another side, and therefore did not get tmaps
250 // propagated to them, treat as a back side.
251 for (i=0; i<MAX_SIDES_PER_SEGMENT; i++)
252 if (!propagated[i]) {
253 med_propagate_tmaps_to_back_side(Cursegp, i, 1);
256 // New stuff, assign default texture to all affected sides.
258 Update_flags |= UF_WORLD_CHANGED;
263 // -----------------------------------------------------------------------------
264 // ---------- segment size control ----------
266 int IncreaseSegLength()
268 return segsize_common(ZDIM,+F1_0);
271 int DecreaseSegLength()
273 return segsize_common(ZDIM,-F1_0);
276 int DecreaseSegWidth()
278 return segsize_common(XDIM,-F1_0);
281 int IncreaseSegWidth()
283 return segsize_common(XDIM,+F1_0);
286 int IncreaseSegHeight()
288 return segsize_common(YDIM,+F1_0);
291 int DecreaseSegHeight()
293 return segsize_common(YDIM,-F1_0);
297 int IncreaseSegLengthBig()
299 return segsize_common(ZDIM,+5 * F1_0);
302 int DecreaseSegLengthBig()
304 return segsize_common(ZDIM,-5 * F1_0);
307 int DecreaseSegWidthBig()
309 return segsize_common(XDIM,-5 * F1_0);
312 int IncreaseSegWidthBig()
314 return segsize_common(XDIM,+5 * F1_0);
317 int IncreaseSegHeightBig()
319 return segsize_common(YDIM,+5 * F1_0);
322 int DecreaseSegHeightBig()
324 return segsize_common(YDIM,-5 * F1_0);
328 int IncreaseSegLengthDefault()
330 return segsize_common(ZDIM,+40 *F1_0);
333 int DecreaseSegLengthDefault()
335 return segsize_common(ZDIM,-40*F1_0);
338 int IncreaseSegWidthDefault()
340 return segsize_common(XDIM,+40*F1_0);
343 int DecreaseSegWidthDefault()
345 return segsize_common(XDIM,-40*F1_0);
348 int IncreaseSegHeightDefault()
350 return segsize_common(YDIM,+40 * F1_0);
353 int DecreaseSegHeightDefault()
355 return segsize_common(YDIM,-40 * F1_0);
360 // ---------------------------------------------------------------------------
361 int ToggleSegSizeMode(void)
364 if (SegSizeMode > SEGSIZEMODE_MAX)
365 SegSizeMode = SEGSIZEMODE_MIN;
370 // ---------------------------------------------------------------------------
371 int PerturbCursideCommon(fix amount)
373 int saveSegSizeMode = SegSizeMode;
374 vms_vector fvec, rvec, uvec;
375 fix fmag, rmag, umag;
378 SegSizeMode = SEGSIZEMODE_CURSIDE;
380 Modified_vertex_index = 0;
382 extract_forward_vector_from_segment(Cursegp, &fvec);
383 extract_right_vector_from_segment(Cursegp, &rvec);
384 extract_up_vector_from_segment(Cursegp, &uvec);
386 fmag = vm_vec_mag(&fvec);
387 rmag = vm_vec_mag(&rvec);
388 umag = vm_vec_mag(&uvec);
390 for (v=0; v<4; v++) {
391 vms_vector perturb_vec;
393 perturb_vec.x = fixmul(rmag, d_rand()*2 - 32767);
394 perturb_vec.y = fixmul(umag, d_rand()*2 - 32767);
395 perturb_vec.z = fixmul(fmag, d_rand()*2 - 32767);
397 scale_vert(Cursegp, Cursegp->verts[Side_to_verts[Curside][v]], &perturb_vec, amount);
400 // validate_segment(Cursegp);
401 // if (SegSizeMode) {
402 // for (i=0; i<MAX_SIDES_PER_SEGMENT; i++)
403 // if (Cursegp->children[i] != -1)
404 // validate_segment(&Segments[Cursegp->children[i]]);
407 validate_modified_segments();
408 SegSizeMode = saveSegSizeMode;
410 Update_flags |= UF_WORLD_CHANGED;
416 // ---------------------------------------------------------------------------
417 int PerturbCurside(void)
419 PerturbCursideCommon(F1_0/10);
424 // ---------------------------------------------------------------------------
425 int PerturbCursideBig(void)
427 PerturbCursideCommon(F1_0/2);