summaryrefslogtreecommitdiff
path: root/rspl/gam.c
diff options
context:
space:
mode:
authorJörg Frings-Fürst <debian@jff-webhosting.net>2015-11-06 05:38:49 +0100
committerJörg Frings-Fürst <debian@jff-webhosting.net>2015-11-06 05:38:49 +0100
commit9491825ddff7a294d1f49061bae7044e426aeb2e (patch)
tree06e651099f87140ec534ae47fb8ce1ac6ec7976d /rspl/gam.c
parentfa756339d4204bff7f2820067f58214d32780d17 (diff)
Imported Upstream version 1.8.3
Diffstat (limited to 'rspl/gam.c')
-rwxr-xr-x[-rw-r--r--]rspl/gam.c46
1 files changed, 46 insertions, 0 deletions
diff --git a/rspl/gam.c b/rspl/gam.c
index e46780f..0765e05 100644..100755
--- a/rspl/gam.c
+++ b/rspl/gam.c
@@ -18,6 +18,52 @@
* Latest simplex/linear equation version.
*/
+/*
+
+ This probably needs re-writing, since (I think) it doesn't take gamut
+ self intersection into account. Outline would be:
+
+ Have a spactial cache structure that contains list of potentialy
+ intersecting triangles for any point. Create this incrementally.
+ Each triangle can be replaced by a list of fragment triangles
+ sharing the same plane.
+
+ i.e.
+
+ triangle planes
+ triangles
+ edges
+ vertexes
+
+ Initialization:
+
+ Locate extreme vertex
+ Locate triangle that uses that vertex that is most elevated
+ in that direction as initial surface.
+ Intersect that triangle with all other triangles nearby, and
+ retain the fragment that has that vertex.
+ List of open edges is initial triangle edges.
+ Track outward and inward faces of all triangles in open surface.
+
+ Basic loop:
+
+ While edge list is non-empty {
+ Locate adjacent triangle that is not part of surface that
+ is most accutely angled to outside face.
+
+ Intersect that triangle with all other triangles using cache structure,
+ hanging on to all resulting fragments that are part of that edge.
+
+ Add those fragments to the open surface.
+
+ }
+
+ Each intersection adds new nodes, and splits a triangle into
+ about 8 smaller triangles. Trick is to avoid slivers and
+ numerical issues with triangles.
+*/
+
+
/* TTBD:
Add ouutput curve lookup callback support.