Home My Page Projects Code Snippets Project Openings diderot
Summary Activity Tracker Tasks SCM

SCM Repository

[diderot] Diff of /branches/vis12/TODO
ViewVC logotype

Diff of /branches/vis12/TODO

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 1204, Thu May 12 19:10:20 2011 UTC revision 1338, Mon Jun 13 19:52:18 2011 UTC
# Line 5  Line 5 
5  SHORT TERM ============= (*needed* for streamlines & tractography)  SHORT TERM ============= (*needed* for streamlines & tractography)
6  ========================  ========================
7    
8  [GLK:3] Add sequence types (needed for evals & evecs)  Remove CL from compiler
9    
10    [GLK:2] Add sequence types (needed for evals & evecs)
11      syntax      syntax
12          types: ty '{' INT '}'          types: ty '{' INT '}'
13          value construction: '{' e1 ',' … ',' en '}'          value construction: '{' e1 ',' … ',' en '}'
14          indexing: e '{' e '}'          indexing: e '{' e '}'
15    
16  [GLK:4] evals & evecs for symmetric tensor[2,2] and  [GLK:3] evals & evecs for symmetric tensor[2,2] and
17  tensor[3,3] (requires sequences)  tensor[3,3] (requires sequences)
18    
19  ability to emit/track/record variables into dynamically re-sized  ability to emit/track/record variables into dynamically re-sized
# Line 23  Line 25 
25  SHORT-ISH TERM ========= (to make using Diderot less annoying to  SHORT-ISH TERM ========= (to make using Diderot less annoying to
26  ========================  program in, and slow to execute)  ========================  program in, and slow to execute)
27    
28  value-numbering optimization [DONE, but needs more testing]  value-numbering optimization [DONE]
29    
30  Allow ".ddro" file extensions in addition to ".diderot"  Allow ".ddro" file extensions in addition to ".diderot"
31    
# Line 31  Line 33 
33  (currently only scalars & vectors).  Want to add some regression tests  (currently only scalars & vectors).  Want to add some regression tests
34  based on this and currently can't  based on this and currently can't
35    
36  [GLK:1] Add a clamp function, which takes three arguments; either  [GLK:1] Proper handling of stabilize method
 three scalars:  
   clamp(lo, hi, x)  = max(lo, min(hi, x))  
 or three vectors of the same size:  
   clamp(lo, hi, [x,y])  = [max(lo[0], min(hi[0], x)),  
                            max(lo[1], min(hi[1], y))]  
 This would be useful in many current Diderot programs.  
 One question: clamp(x, lo, hi) is the argument order used in OpenCL  
 and other places, but clamp(lo, hi, x) is much more consistent with  
 lerp(lo, hi, x), hence GLK's preference  
   
 [GLK:2] Proper handling of stabilize method  
37    
38  allow "*" to represent "modulate": per-component multiplication of  allow "*" to represent "modulate": per-component multiplication of
39  vectors, and vectors only (not tensors of order 2 or higher).  Once  vectors, and vectors only (not tensors of order 2 or higher).  Once
# Line 52  Line 43 
43  implicit type promotion of integers to reals where reals are  implicit type promotion of integers to reals where reals are
44  required (e.g. not exponentiation "^")  required (e.g. not exponentiation "^")
45    
46  [GLK:5] Save Diderot output to nrrd, instead of "mip.txt"  [GLK:4] Save Diderot output to nrrd, instead of "mip.txt"
47    For grid of strands, save to similarly-shaped array    For grid of strands, save to similarly-shaped array
48    For list of strands, save to long 1-D (or 2-D for non-scalar output) list    For list of strands, save to long 1-D (or 2-D for non-scalar output) list
49    For ragged things (like tractography output), will need to save both    For ragged things (like tractography output), will need to save both
50      complete list of values, as well as list of start indices and lengths      complete list of values, as well as list of start indices and lengths
51      to index into complete list      to index into complete list
52    
53  [GLK:6] Use of Teem's "hest" command-line parser for getting  [GLK:5] Use of Teem's "hest" command-line parser for getting
54  any input variables that are not defined in the source file  any "input" variables that are not defined in the source file.
55    
56  [GLK:7] ability to declare a field so that probe positions are  [GLK:6] ability to declare a field so that probe positions are
57  *always* "inside"; with various ways of mapping the known image values  *always* "inside"; with various ways of mapping the known image values
58  to non-existant index locations.  One possible syntax emphasizes that  to non-existant index locations.  One possible syntax emphasizes that
59  there is a index mapping function that logically precedes convolution:  there is a index mapping function that logically precedes convolution:
# Line 93  Line 84 
84    
85  "initially" supports lists  "initially" supports lists
86    
87  "initially" supports lists of positions output from  "initially" supports lists of positions output from different
88  different initalization Diderot program  initalization Diderot program (or output from the same program;
89    e.g. using output of iso2d.diderot for one isovalue to seed the input
90    to another invocation of the same program)
91    
92  Communication between strands: they have to be able to learn each  Communication between strands: they have to be able to learn each
93  other's state (at the previous iteration).  Early version of this can  other's state (at the previous iteration).  Early version of this can
# Line 114  Line 107 
107  Allow integer exponentiation ("^2") to apply to square matrices,  Allow integer exponentiation ("^2") to apply to square matrices,
108  to represent repeated matrix multiplication  to represent repeated matrix multiplication
109    
 Alow X *= Y, X /= Y, X += Y, X -= Y to mean what they do in C,  
 provided that X*Y, X/Y, X+Y, X-Y are already supported.  
 Nearly every Diderot program would be simplified by this.  
   
110  Put small 1-D and 2-D fields, when reconstructed specifically by tent  Put small 1-D and 2-D fields, when reconstructed specifically by tent
111  and when differentiation is not needed, into faster texture buffers.  and when differentiation is not needed, into faster texture buffers.
112  test/illust-vr.diderot is good example of program that uses multiple  test/illust-vr.diderot is good example of program that uses multiple
113  such 1-D fields basically as lookup-table-based function evaluation  such 1-D fields basically as lookup-table-based function evaluation
114    
115  expand trace in mid to low translation  expand trace in mid to low translation [DONE]
116    
117  extend norm (|exp|) to all tensor types [DONE for vectors and matrices]  extend norm (|exp|) to all tensor types [DONE for vectors and matrices]
118    
# Line 162  Line 151 
151  (but we should only duplicate over the live-range of the result of the  (but we should only duplicate over the live-range of the result of the
152  conditional.  conditional.
153    
154  [GLK:8] Want: non-trivial field expressions & functions.  [GLK:7] Want: non-trivial field expressions & functions.
155  scalar fields from scalar fields F and G:  scalar fields from scalar fields F and G:
156    field#0(2)[] X = (sin(F) + 1.0)/2;    field#0(2)[] X = (sin(F) + 1.0)/2;
157    field#0(2)[] X = F*G;    field#0(2)[] X = F*G;
# Line 205  Line 194 
194    field#2(3)[] F = bspln3 ⊛ img;    field#2(3)[] F = bspln3 ⊛ img;
195  or, as a tensor product of kernels, one for each axis, e.g.  or, as a tensor product of kernels, one for each axis, e.g.
196    field#0(3)[] F = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img;    field#0(3)[] F = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img;
197  This is especially important for things like time-varying data, or  This is especially important for things like time-varying fields
198  other multi-dimensional fields where one axis of the domain is very  and the use of scale-space in field visualization: one axis of the
199  different from the rest, and hence must be treated separately when  must be convolved with a different kernel during probing.
200  it comes to convolution.  What is very unclear is how, in such cases,  What is very unclear is how, in such cases, we should notate the
201  we should notate the gradient, when we only want to differentiate with  gradient, when we only want to differentiate with respect to some
202  respect to some subset of the axes.  One ambitious idea would be:  subset of the axes.  One ambitious idea would be:
203    field#0(3)[] Ft = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img; // 2D time-varying field    field#0(3)[] Ft = (bspln3 ⊗ bspln3 ⊗ tent) ⊛ img; // 2D time-varying field
204    field#0(2)[] F = lambda([x,y], Ft([x,y,42.0]))     // restriction to time=42.0    field#0(2)[] F = lambda([x,y], Ft([x,y,42.0]))     // restriction to time=42.0
205    vec2 grad = ∇F([x,y]);                             // 2D gradient    vec2 grad = ∇F([x,y]);                             // 2D gradient
# Line 264  Line 253 
253  //  uncaught exception Size [size]  //  uncaught exception Size [size]
254  //    raised at c-target/c-target.sml:47.15-47.19  //    raised at c-target/c-target.sml:47.15-47.19
255  //field#4(3)[] F = img ⊛ bspln5;  //field#4(3)[] F = img ⊛ bspln5;
256    
257    test/lic2.diderot:
258    error in addEdge(ENTRY01D8,NULL0006)
259    uncaught exception Fail [Fail: setPred on NULL node NULL0006]
260      raised at common/phase-timer.sml:76.50-76.52
261      raised at IL/ssa-fn.sml:308.7-308.9
262      raised at IL/ssa-fn.sml:245.26-245.70

Legend:
Removed from v.1204  
changed lines
  Added in v.1338

root@smlnj-gforge.cs.uchicago.edu
ViewVC Help
Powered by ViewVC 1.0.0