Notes:Mapping in cyclic worlds - Revision history

Frankiezafe: /* Resources */

2017-09-02T18:24:38Z

‎Resources

Frankiezafe: /* Resources */

2017-09-02T18:24:16Z

‎Resources

Frankiezafe: /* remap method() */

2017-09-02T17:53:15Z

‎remap method()

Frankiezafe: /* functions (js) */

2017-09-02T15:01:33Z

‎functions (js)

Frankiezafe: /* functions (js) */

2017-09-02T15:00:24Z

‎functions (js)

Frankiezafe: /* identification of the nearest limit */

2017-09-02T11:23:32Z

‎identification of the nearest limit

Frankiezafe: /* identification of the nearest limit */

2017-09-02T11:23:05Z

‎identification of the nearest limit

Frankiezafe: /* identification of the nearest limit */

2017-09-02T11:22:47Z

‎identification of the nearest limit

Frankiezafe: /* functions (js) */

2017-09-02T11:18:58Z

‎functions (js)

Frankiezafe: /* remap method() */

2017-09-02T10:44:22Z

‎remap method()

@@ Line 192: / Line 192: @@
 <html><iframe width="560" height="315" src="https://www.youtube.com/embed/65wYmy8Pf-Y" frameborder="0" allowfullscreen></iframe></html>
-* [[wikipedia:Color_wheel_graphs_of_complex_functions Color wheel graphs of complex functions]]
+* [[wikipedia:Color_wheel_graphs_of_complex_functions|Color wheel graphs of complex functions]]
 [[Category:analysis]]

@@ Line 191: / Line 191: @@
 <html><iframe width="560" height="315" src="https://www.youtube.com/embed/65wYmy8Pf-Y" frameborder="0" allowfullscreen></iframe></html>
-−
 [[Category:analysis]]

← Older revision		Revision as of 17:53, 2 September 2017
Line 187:		Line 187:

	le process semble ok pour les angles compris entre a et d		le process semble ok pour les angles compris entre a et d
		+
		+	== Resources ==
		+
		+	<html><iframe width="560" height="315" src="https://www.youtube.com/embed/65wYmy8Pf-Y" frameborder="0" allowfullscreen></iframe></html>

@@ Line 49: / Line 49: @@
 * Calculation of the distance between the bounded value and the middle of the new range. This returns a value between -''half'' and ''half''. Because we will have to map this distance to the new range, we have to divide it by ''half''. This returns a percentage. Its value is in the range [-2, 2]. Indeed, the value to map might be at the opposite of the the middle of the new range. Because world space is cyclic, if the absolute value of the percentage is greater than 1, 1.5 for instance, the value can be bounded in the range [-1, 1]. The 1.5 becomes -0.5, and it's still the same value.
 * Calculation of the new range. The distance between one of the limits ( ''to_in'' or ''to_out'' ) and their center (''bmid'') has to be removed form the half of the world range. Once done, the new range might exceed the half of the world range, when ''to_out'' is smaller than the lower limit (''to_in'') of the world, for instance. Therefore, we have to bound the new range between -''half'' and ''half''. From now on, the percentage and the new range can be multiply by one another .
-* Last step is to check the sign of the percentage. If it is positive, the limit to use is the highest one, '''bout'''. We add the percentage of the half world range and returns the value. If it is negative, the process is similar but uses the lower limit '''bin'''.
+* Last step is to check the sign of the percentage. If it is positive, the limit to use is the highest one, '''bout'''. We add the percentage of the new range and returns the value. If it is negative, the process is similar but uses the lower limit '''bin'''.
   function cyclic_map( value, from_in, from_out, to_in, to_out ) {

@@ Line 48: / Line 48: @@
 * Calculation of the distance between the bounded value and the middle of the new range. This returns a value between -''half'' and ''half''. Because we will have to map this distance to the new range, we have to divide it by ''half''. This returns a percentage. Its value is in the range [-2, 2]. Indeed, the value to map might be at the opposite of the the middle of the new range. Because world space is cyclic, if the absolute value of the percentage is greater than 1, 1.5 for instance, the value can be bounded in the range [-1, 1]. The 1.5 becomes -0.5, and it's still the same value.
-* Calculation of the new range. The distance between one of the limits ( ''to_in'' or ''to_out'' ) and their center (''bmid') has to be removed form the half of the world range. Once done, the new range might exceed the half of the world range, when ''to_in'' was smaller than the lower limit of the world, for instance. Therefore, we have to bound the new range between -''half'' and ''half''. From now on, the percentage and the new range can be multiply by one another .
+* Calculation of the new range. The distance between one of the limits ( ''to_in'' or ''to_out'' ) and their center (''bmid'') has to be removed form the half of the world range. Once done, the new range might exceed the half of the world range, when ''to_out'' is smaller than the lower limit (''to_in'') of the world, for instance. Therefore, we have to bound the new range between -''half'' and ''half''. From now on, the percentage and the new range can be multiply by one another .
 * Last step is to check the sign of the percentage. If it is positive, the limit to use is the highest one, '''bout'''. We add the percentage of the half world range and returns the value. If it is negative, the process is similar but uses the lower limit '''bin'''.

@@ Line 87: / Line 87: @@
      bvalue >= bmid + half
    ) ) {
    return bin;
   } else if ( crejected_in && (
      bvalue <= bmid ||
      bvalue > bmid + half
    ) ) {
    return bin;
   } else if ( crejected_out && (
      bvalue < bmid &&
      bvalue >= bmid - half
    ) ) {
    return bin;
+  }

@@ Line 82: / Line 82: @@
   boolean crejected_in =  (bmid <= bout) &&  (bin > bmid);
   boolean crejected_out = (bin <= bmid) &&   (bout < bmid) && !cnormal;
-−
   if ( cnormal && (
      ( bvalue <= bmid && bvalue >= bmid - half ) ||
      bvalue >= bmid + half
    ) ) {
-−
    return bin;

@@ Line 33: / Line 33: @@
+  }
-'''cyclic_bound''' is applied on all entries of the mapping function.
+''cyclic_bound'' is applied on all entries of the mapping function.
   function cyclic_map( value, from_in, from_out, to_in, to_out ) {
@@ Line 52: / Line 68: @@
+  }
 == research ==

← Older revision		Revision as of 10:44, 2 September 2017
Line 148:		Line 148:
	[[Category:math]]		[[Category:math]]
	[[Category:processing.org]]		[[Category:processing.org]]
		+	[[Category:javascript]]