diff --git a/doc/development/feature/mind-map/index.html b/doc/development/feature/mind-map/index.html index f50fbe9cc..fa5950af2 100644 --- a/doc/development/feature/mind-map/index.html +++ b/doc/development/feature/mind-map/index.html @@ -136,34 +136,34 @@
http://worrydream.com/MediaForThinkingTheUnthinkable/note.html
http://worrydream.com/TheHumaneRepresentationOfThought/note.html
+
https://www.youtube.com/watch?v=YyIQKBzIuBY, HPI
-
+
Reading and Writing the Electronic Book 3
- Designing for Digital Reading 3
¶
-
+
Dreaming in code: two dozen programmers, three years, 4,732 bugs, and
4
¶
-
+
In In The cognitive basis for academic workflows, Lisa D. Harper looks at sensemaking
models as a way to understand academic workflows.
-
+
Handling Massive Transform Updates in a Scenegraph 6
dynamic scene graph: many updates
+ dynamic scene graph: many updates
extract just transform nodes to a transform tree extract just transform nodes to a transform tree
- The world matrix is used for shader, culling, bounding box, collision
+
+ The world matrix is used for shader, culling, bounding box, collision
detection.
+ style=" clear: both; " />
Lazy incremental computation for efficient scene graph rendering 6
scene graph creates dependency graph
+ scene graph creates dependency graph
program updates scene graph updates program updates scene graph updates
- Incremental context-dependent analysis for language-based editors 6
¶
Incremental attribute evaluation: A flexible algorithm for lazy
6
¶
- They use a semantic scene graph as in Separating semantics from rendering: a
+ They use a semantic scene graph as in Separating semantics from rendering: a
scene graph based architecture for graphics applications Tobler (2011) — traversal
cost is high — caching eliminates this cost.
- caching however occurs an overhead (see Table 1 of paper) at startup
+ caching however occurs an overhead (see Table 1 of paper) at startup
time
- need to benchmark the number of draw calls to see when it will pay off:
- need to benchmark the number of draw calls to see when it will pay off:
+ can be parallelised
+ can be parallelised
Separating semantics from rendering: a scene graph based architecture for
6
¶
- semantic graph is used to keep application state inside of graph
- application acts like a compiler
- semantic scene graph semantic graph is used to keep application state inside of graph
+ application acts like a compiler
+ semantic scene graph a single semantic scene graph node can build many intermediate rendering scene
+ a single semantic scene graph node can build many intermediate rendering scene
graph nodes that differ based on rendering backend
- applicator nodes are trees as well
- transformation applicator nodes are trees as well
+ transformation children: transformation matrices
+ children: transformation matrices
aggregator: matrix multiplication LOD node: returns a different scene graph based on level
- multiple-view has both: aggregator: matrix multiplication LOD node: returns a different scene graph based on level
+ multiple-view has both: shared data
+ shared data
private data for private data for traversal cache
+ traversal cache
traversal state editing of semantic nodes traversal state editing of semantic nodes back references
+ back references
a little unclear why have 2 rendering scene graphs a little unclear why have 2 rendering scene graphs rendering scene graph is cached by creating scene graph forest
+ rendering scene graph is cached by creating scene graph forest
Scene-Graph-As-Bus: Collaboration between Heterogeneous Stand-alone
6
¶
- networking
-
+ networking
+
TODO
-
+ TODO
+
Attribute grammars were first introduced by Knuth. They consist of a normal
+ Attribute grammars were first introduced by Knuth. They consist of a normal
grammar, but augmented with attributes. Attributes are the results of calculations
based on the values and attributes of nodes in the parse tree. Knuth (1968).
- One issue with attributes grammars is determining the order of evaluation. One
+ One issue with attributes grammars is determining the order of evaluation. One
naive approach is to use a topological sort based on the dependency graph of the
attributes.
+
@@ -544,7 +544,7 @@ Data structure Data structure Attribute grammar (UUAGC syntax) Attribute grammar (UUAGC syntax)
- In this example, the attribute grammar defines a
+ In this example, the attribute grammar defines a synthesised attribute Sum. The
order of evaluation is bottom-up and since this grammar only uses a synthesised
attribute, it is an S-attributed grammar.
- There are also special classes of attribute grammars than can be evaluated in a
+ There are also special classes of attribute grammars than can be evaluated in a
single pass during parsing despite having both synthesised attributes and inherited
attributes.
- For a synthesised attribute For a synthesised attribute For the inherited attribute For the inherited attribute However, to evaluate a general class of attribute grammars, a specific traversal
+ However, to evaluate a general class of attribute grammars, a specific traversal
would be needed for each attribute grammar depending on the dependencies for the
semantic functions. There existed algorithms that can take a specific attribute
grammar and compute a traversal function for an attribute. Some of these are
@@ -716,7 +716,7 @@ These algorithms are often used in an ahead of time compiler in order to generate
+ These algorithms are often used in an ahead of time compiler in order to generate
a static tree-walker evaluator. However, in some applications, an online version may
be useful for dynamic editing of values on the trees or changes to the tree structure
itself (e.g., a language editor). This merges the work in attribute grammars
@@ -726,7 +726,7 @@ In order to use attribute grammars in a way that they can be composable (in FP,
+ In order to use attribute grammars in a way that they can be composable (in FP,
@@ -735,11 +735,11 @@
+
+
3 Design of electronic books
-4 Software engineering
-5 Workflow
-6 Scene graphs
-
+
6
-
-
-
-
-
-OpenSceneGraph
-7 Attribute grammars
-7 Steinlechner et al. (2019).
-
interface 7 { }
-syn 7 Sum
7 Bransen et al. (2012).
-
7 Ramalingam and
Reps (1993).
-
7 Sloane
et al. (2010).
-
8 Incremental computing
-9 Self-adjusting computation
@@ -1233,7 +1233,7 @@
-Last edited Thu Feb 24 02:29:38 2022
+Last edited Mon Nov 20 05:17:01 2023
Project Renard Step 001