diff --git a/.gitattributes b/.gitattributes index 1ff0c42..bf0e54a 100644 --- a/.gitattributes +++ b/.gitattributes @@ -1,63 +1,63 @@ -############################################################################### -# Set default behavior to automatically normalize line endings. -############################################################################### -* text=auto - -############################################################################### -# Set default behavior for command prompt diff. -# -# This is need for earlier builds of msysgit that does not have it on by -# default for csharp files. -# Note: This is only used by command line -############################################################################### -#*.cs diff=csharp - -############################################################################### -# Set the merge driver for project and solution files -# -# Merging from the command prompt will add diff markers to the files if there -# are conflicts (Merging from VS is not affected by the settings below, in VS -# the diff markers are never inserted). Diff markers may cause the following -# file extensions to fail to load in VS. An alternative would be to treat -# these files as binary and thus will always conflict and require user -# intervention with every merge. To do so, just uncomment the entries below -############################################################################### -#*.sln merge=binary -#*.csproj merge=binary -#*.vbproj merge=binary -#*.vcxproj merge=binary -#*.vcproj merge=binary -#*.dbproj merge=binary -#*.fsproj merge=binary -#*.lsproj merge=binary -#*.wixproj merge=binary -#*.modelproj merge=binary -#*.sqlproj merge=binary -#*.wwaproj merge=binary - -############################################################################### -# behavior for image files -# -# image files are treated as binary by default. -############################################################################### -#*.jpg binary -#*.png binary -#*.gif binary - -############################################################################### -# diff behavior for common document formats -# -# Convert binary document formats to text before diffing them. This feature -# is only available from the command line. Turn it on by uncommenting the -# entries below. -############################################################################### -#*.doc diff=astextplain -#*.DOC diff=astextplain -#*.docx diff=astextplain -#*.DOCX diff=astextplain -#*.dot diff=astextplain -#*.DOT diff=astextplain -#*.pdf diff=astextplain -#*.PDF diff=astextplain -#*.rtf diff=astextplain -#*.RTF diff=astextplain +############################################################################### +# Set default behavior to automatically normalize line endings. +############################################################################### +* -text + +############################################################################### +# Set default behavior for command prompt diff. +# +# This is need for earlier builds of msysgit that does not have it on by +# default for csharp files. +# Note: This is only used by command line +############################################################################### +#*.cs diff=csharp + +############################################################################### +# Set the merge driver for project and solution files +# +# Merging from the command prompt will add diff markers to the files if there +# are conflicts (Merging from VS is not affected by the settings below, in VS +# the diff markers are never inserted). Diff markers may cause the following +# file extensions to fail to load in VS. An alternative would be to treat +# these files as binary and thus will always conflict and require user +# intervention with every merge. To do so, just uncomment the entries below +############################################################################### +#*.sln merge=binary +#*.csproj merge=binary +#*.vbproj merge=binary +#*.vcxproj merge=binary +#*.vcproj merge=binary +#*.dbproj merge=binary +#*.fsproj merge=binary +#*.lsproj merge=binary +#*.wixproj merge=binary +#*.modelproj merge=binary +#*.sqlproj merge=binary +#*.wwaproj merge=binary + +############################################################################### +# behavior for image files +# +# image files are treated as binary by default. +############################################################################### +#*.jpg binary +#*.png binary +#*.gif binary + +############################################################################### +# diff behavior for common document formats +# +# Convert binary document formats to text before diffing them. This feature +# is only available from the command line. Turn it on by uncommenting the +# entries below. +############################################################################### +#*.doc diff=astextplain +#*.DOC diff=astextplain +#*.docx diff=astextplain +#*.DOCX diff=astextplain +#*.dot diff=astextplain +#*.DOT diff=astextplain +#*.pdf diff=astextplain +#*.PDF diff=astextplain +#*.rtf diff=astextplain +#*.RTF diff=astextplain diff --git a/.gitignore b/.gitignore index d1dfddd..eb83a8f 100644 --- a/.gitignore +++ b/.gitignore @@ -1,264 +1,34 @@ -## Ignore Visual Studio temporary files, build results, and -## files generated by popular Visual Studio add-ons. - -# User-specific files +/[Ll]ibrary/ +/[Tt]emp/ +/[Oo]bj/ +/[Bb]uild/ +/[Bb]uilds/ +/Assets/AssetStoreTools* + +# Visual Studio 2015 cache directory +/.vs/ + +# Autogenerated VS/MD/Consulo solution and project files +ExportedObj/ +.consulo/ +*.csproj +*.unityproj +*.sln *.suo +*.tmp *.user -*.userosscache -*.sln.docstates - -# User-specific files (MonoDevelop/Xamarin Studio) *.userprefs - -# Build results -[Dd]ebug/ -[Dd]ebugPublic/ -[Rr]elease/ -[Rr]eleases/ -x64/ -x86/ -bld/ -[Bb]in/ -[Oo]bj/ -[Ll]og/ - -# Visual Studio 2015 cache/options directory -.vs/ -# Uncomment if you have tasks that create the project's static files in wwwroot -#wwwroot/ - -# MSTest test Results -[Tt]est[Rr]esult*/ -[Bb]uild[Ll]og.* - -# NUNIT -*.VisualState.xml -TestResult.xml - -# Build Results of an ATL Project -[Dd]ebugPS/ -[Rr]eleasePS/ -dlldata.c - -# DNX -project.lock.json -project.fragment.lock.json -artifacts/ - -*_i.c -*_p.c -*_i.h -*.ilk -*.meta -*.obj -*.pch -*.pdb -*.pgc -*.pgd -*.rsp -*.sbr -*.tlb -*.tli -*.tlh -*.tmp -*.tmp_proj -*.log -*.vspscc -*.vssscc -.builds *.pidb -*.svclog -*.scc - -# Chutzpah Test files -_Chutzpah* - -# Visual C++ cache files -ipch/ -*.aps -*.ncb -*.opendb -*.opensdf -*.sdf -*.cachefile -*.VC.db -*.VC.VC.opendb - -# Visual Studio profiler -*.psess -*.vsp -*.vspx -*.sap - -# TFS 2012 Local Workspace -$tf/ - -# Guidance Automation Toolkit -*.gpState - -# ReSharper is a .NET coding add-in -_ReSharper*/ -*.[Rr]e[Ss]harper -*.DotSettings.user - -# JustCode is a .NET coding add-in -.JustCode - -# TeamCity is a build add-in -_TeamCity* - -# DotCover is a Code Coverage Tool -*.dotCover - -# NCrunch -_NCrunch_* -.*crunch*.local.xml -nCrunchTemp_* - -# MightyMoose -*.mm.* -AutoTest.Net/ - -# Web workbench (sass) -.sass-cache/ - -# Installshield output folder -[Ee]xpress/ - -# DocProject is a documentation generator add-in -DocProject/buildhelp/ -DocProject/Help/*.HxT -DocProject/Help/*.HxC -DocProject/Help/*.hhc -DocProject/Help/*.hhk -DocProject/Help/*.hhp -DocProject/Help/Html2 -DocProject/Help/html - -# Click-Once directory -publish/ - -# Publish Web Output -*.[Pp]ublish.xml -*.azurePubxml -# TODO: Comment the next line if you want to checkin your web deploy settings -# but database connection strings (with potential passwords) will be unencrypted -#*.pubxml -*.publishproj - -# Microsoft Azure Web App publish settings. Comment the next line if you want to -# checkin your Azure Web App publish settings, but sensitive information contained -# in these scripts will be unencrypted -PublishScripts/ - -# NuGet Packages -*.nupkg -# The packages folder can be ignored because of Package Restore -**/packages/* -# except build/, which is used as an MSBuild target. -!**/packages/build/ -# Uncomment if necessary however generally it will be regenerated when needed -#!**/packages/repositories.config -# NuGet v3's project.json files produces more ignoreable files -*.nuget.props -*.nuget.targets - -# Microsoft Azure Build Output -csx/ -*.build.csdef - -# Microsoft Azure Emulator -ecf/ -rcf/ - -# Windows Store app package directories and files -AppPackages/ -BundleArtifacts/ -Package.StoreAssociation.xml -_pkginfo.txt - -# Visual Studio cache files -# files ending in .cache can be ignored -*.[Cc]ache -# but keep track of directories ending in .cache -!*.[Cc]ache/ - -# Others -ClientBin/ -~$* -*~ -*.dbmdl -*.dbproj.schemaview -*.jfm -*.pfx -*.publishsettings -node_modules/ -orleans.codegen.cs - -# Since there are multiple workflows, uncomment next line to ignore bower_components -# (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) -#bower_components/ - -# RIA/Silverlight projects -Generated_Code/ - -# Backup & report files from converting an old project file -# to a newer Visual Studio version. Backup files are not needed, -# because we have git ;-) -_UpgradeReport_Files/ -Backup*/ -UpgradeLog*.XML -UpgradeLog*.htm - -# SQL Server files -*.mdf -*.ldf - -*.lock - -# Business Intelligence projects -*.rdl.data -*.bim.layout -*.bim_*.settings - -# Microsoft Fakes -FakesAssemblies/ - -# GhostDoc plugin setting file -*.GhostDoc.xml - -# Node.js Tools for Visual Studio -.ntvs_analysis.dat - -# Visual Studio 6 build log -*.plg - -# Visual Studio 6 workspace options file -*.opt - -# Visual Studio LightSwitch build output -**/*.HTMLClient/GeneratedArtifacts -**/*.DesktopClient/GeneratedArtifacts -**/*.DesktopClient/ModelManifest.xml -**/*.Server/GeneratedArtifacts -**/*.Server/ModelManifest.xml -_Pvt_Extensions - -# Paket dependency manager -.paket/paket.exe -paket-files/ - -# FAKE - F# Make -.fake/ - -# JetBrains Rider -.idea/ -*.sln.iml +*.booproj +*.svd +*.pdb -# CodeRush -.cr/ +# Unity3D generated meta files +*.pidb.meta -# Python Tools for Visual Studio (PTVS) -__pycache__/ -*.pyc +# Unity3D Generated File On Crash Reports +sysinfo.txt +# Builds +*.apk +*.unitypackage diff --git a/Docs Diagrams/SymEdges.JPG b/Docs Diagrams/SymEdges.JPG index 3707e6d..4802d08 100644 Binary files a/Docs Diagrams/SymEdges.JPG and b/Docs Diagrams/SymEdges.JPG differ diff --git a/Docs Diagrams/dual.jpeg b/Docs Diagrams/dual.jpeg new file mode 100644 index 0000000..f92d4d2 Binary files /dev/null and b/Docs Diagrams/dual.jpeg differ diff --git a/Docs Diagrams/subdivide.JPG b/Docs Diagrams/subdivide.JPG new file mode 100644 index 0000000..04a2930 Binary files /dev/null and b/Docs Diagrams/subdivide.JPG differ diff --git a/Docs Diagrams/vertexsplit.JPG b/Docs Diagrams/vertexsplit.JPG new file mode 100644 index 0000000..aad64a8 Binary files /dev/null and b/Docs Diagrams/vertexsplit.JPG differ diff --git a/Docs/Game Design/game_design_documentation.pdf b/Docs/Game Design/game_design_documentation.pdf new file mode 100644 index 0000000..4670b65 Binary files /dev/null and b/Docs/Game Design/game_design_documentation.pdf differ diff --git a/Docs/User Manual/user_manual.pdf b/Docs/User Manual/user_manual.pdf new file mode 100644 index 0000000..a9206f1 Binary files /dev/null and b/Docs/User Manual/user_manual.pdf differ diff --git a/Docs/html/SymEdges.jpg b/Docs/html/SymEdges.jpg index 3707e6d..4802d08 100644 Binary files a/Docs/html/SymEdges.jpg and b/Docs/html/SymEdges.jpg differ diff --git a/Docs/html/_cell_8cs_source.html b/Docs/html/_cell_8cs_source.html index 2463217..74c5c68 100644 --- a/Docs/html/_cell_8cs_source.html +++ b/Docs/html/_cell_8cs_source.html @@ -5,7 +5,7 @@ -PlanetCasson: PlanetCasson/Assets/Model/Cell.cs Source File +Planet Casson: Planet Casson/Assets/Model/Cell.cs Source File @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -61,7 +61,7 @@
@@ -69,25 +69,40 @@
Cell.cs
-
1 using System.Collections;
2 using System.Collections.Generic;
3 using System.Linq;
4 using Model;
5 using UnityEngine;
6 
10 namespace Model
11 {
16  public class Cell
17  {
18  List<Vertex> verticies;
19  List<Edge> edges;
20  List<Face> faces;
21 
22  //private constructor to initilize a cell
23  private Cell()
24  {
25  verticies = new List<Vertex>();
26  edges = new List<Edge>();
27  faces = new List<Face>();
28  }
29 
30  //make a tetrahedron quad edge graph
31  public static Cell MakePrimitiveCell()
32  {
33  Vertex vx = Vertex.NewVertex(); //Center Vertex
34  Vertex vab = Vertex.NewVertex();
35  Vertex vac = Vertex.NewVertex();
36  Vertex vcb = Vertex.NewVertex();
37 
38  Edge ea = Edge.NewEdge();
39  Edge eb = Edge.NewEdge();
40  Edge ec = Edge.NewEdge();
41  Edge eacx = Edge.NewEdge();
42  Edge ecbx = Edge.NewEdge();
43  Edge eabx = Edge.NewEdge();
44 
45  Face fa = Face.NewFace();
46  Face fb = Face.NewFace();
47  Face fc = Face.NewFace();
48  Face fx = Face.NewFace();
49 
50  ea.ConnectEdge(vac, vab, fx, fa);
51  eb.ConnectEdge(vab, vcb, fx, fb);
52  ec.ConnectEdge(vcb, vac, fx, fc);
53  eacx.ConnectEdge(vac, vx, fa, fc);
54  ecbx.ConnectEdge(vcb, vx, fc, fb);
55  eabx.ConnectEdge(vab, vx, fb, fa);
56 
57  Cell sphereCell = new Cell();
58  sphereCell.verticies.AddRange(new List<Vertex>() { vx, vab, vac, vcb });
59  sphereCell.faces.AddRange(new List<Face>() { fa, fb, fc, fx });
60  sphereCell.edges.AddRange(new List<Edge>() { ea, eb, ec, eacx, ecbx, eabx });
61 
62  return sphereCell;
63  }
64 
65  public void calculatePositions()
66  {
67  for (int i = 0; i < verticies.Count; i++)
68  {
69  verticies[i].pos = new Vector3(i % 2, i % 3, i % 5); //This is a really dumb way to visualize graphs and we need to figure out something better
70  }
71  }
72 
73  public void instantiateGraph(MonoBehaviour obj, GameObject vertexObj, GameObject edgeObj)
74  {
75  GameObject[] vObjs = new GameObject[verticies.Count];
76  GameObject[] eObjs = new GameObject[edges.Count];
77  for (int i = 0; i < verticies.Count; i++)
78  {
79  vObjs[i] = Object.Instantiate(vertexObj, verticies[i].pos, Quaternion.identity, obj.gameObject.transform);
80  }
81  for (int i = 0; i < edges.Count; i++)
82  {
83  eObjs[i] = Object.Instantiate(edgeObj, Vector3.zero, Quaternion.identity, obj.gameObject.transform);
84  LineRenderer lr = eObjs[i].GetComponent<LineRenderer>();
85  lr.positionCount = 2;
86  lr.SetPosition(0, edges[i].Orig.pos);
87  lr.SetPosition(1, edges[i].Dest.pos);
88  }
89  }
90 
91  //splits a vertex and create a new edge in between
92  //preserves euler characteristics
93  //use this to change graph
94  public Edge makeVertexEdge(Vertex v, Face left, Face right)
95  {
96  //all edges are edges that points towards v
97 
98  //find edges that points towards v and boarders left and right
99  Edge[] leftEdges = (Edge[])v.destEdges.Intersect(left.edges);
100  Edge[] rightEdges = (Edge[])v.destEdges.Intersect(right.edges);
101 
102  //checks if there are 2 leftEdges and 2 rightEdges (as there should be)
103  if (leftEdges.Length != 2 && rightEdges.Length != 2)
104  return null;
105 
106  List<Edge> topEdges = new List<Edge>();
107 
108  //tests to see if leftEdges[0] is the bottom edge
109  if (leftEdges[0].Dnext() == leftEdges[1])
110  topEdges.Add(leftEdges[0]);
111  else
112  topEdges.Add(leftEdges[1]);
113 
114  //test to see if rightEdges[0] is the bottom edge
115  if (rightEdges[0].Dprev() == rightEdges[1])
116  topEdges.Add(rightEdges[0]);
117  else
118  topEdges.Add(rightEdges[1]);
119 
120  //fills top edges
121  while (true)
122  {
123  int i = topEdges.Count - 2;
124  Edge temp = topEdges[i].Dprev();
125  if (temp == topEdges.Last())
126  {
127  break;
128  }
129  topEdges.Insert(i + 1, temp);
130  }
131 
132  Vertex newV = Vertex.NewVertex();
133  for (int i = 0; i < topEdges.Count; i++)
134  {
135  topEdges[i].Dest = newV;
136  }
137  Edge newE = Edge.NewEdge();
138  newE.ConnectEdge(v, newV, left, right);
139  verticies.Add(newV);
140  edges.Add(newE);
141  return newE;
142  }
143 
144  //"unsplits" a vertex
145  //preserves euler characteristics
146  //use this to change graph
147  //can create digons(use carefully)
148  public void killVertexEdge(Vertex v, Face left, Face right)
149  {
150  Edge disposedEdge = null;
151  Vertex rebindV;
152 
153  foreach (Edge e in left.edges.Intersect(right.edges))
154  {
155  if (e.Dest == v)
156  {
157  disposedEdge = e;
158  break;
159  }
160  }
161 
162  //check to see if valid deletion
163  if (disposedEdge == null) return;
164 
165  rebindV = disposedEdge.Orig;
166 
167  //disconnect the edge
168  disposedEdge.DisconnectEdge();
169 
170  //rebind edges on v to the vertex at disposedEdge.Orig
171  foreach (Edge e in v.destEdges)
172  {
173  e.Dest = rebindV;
174  }
175 
176  edges.Remove(disposedEdge);
177  verticies.Remove(v);
178  }
179 
180  //subdivide a face
181  //preserves euler characteristics
182  //use this to change graph
183  public Edge makeFaceEdge(Face f, Vertex orig, Vertex dest)
184  {
185  //find an edge pointing away from the starting point and on f
186  List<Edge> fEdges = (List<Edge>)orig.origEdges.Intersect(f.edges);
187  //check that there should be 2
188  if (fEdges.Count != 2)
189  return null;
190  //remove edge pointing left
191  if (fEdges[0].Oprev() == fEdges[1])
192  fEdges.Remove(fEdges[0]);
193  else
194  fEdges.Remove(fEdges[1]);
195 
196  //check to see if already hit dest
197  if (fEdges.Last().Dest != dest)
198  {
199  //accumulate traversed edges until hit dest
200  do
201  {
202  fEdges.Add(fEdges.Last().Lnext());
203  } while (fEdges.Last().Dest != dest);
204  }
205  //fEdges should now contains all edges(pointing in ccw dir) for new face except new edge
206 
207  Face newF = Face.NewFace();
208  for (int i = 0; i < fEdges.Count; i++)
209  {
210  fEdges[i].Left = newF;
211  }
212  Edge newE = Edge.NewEdge();
213  newE.ConnectEdge(orig, dest, f, newF);
214  faces.Add(newF);
215  edges.Add(newE);
216  return newE;
217  }
218 
219  //undos makeFaceEdge
220  public void killFaceEdge(Edge e)
221  {
222 
223  Face rf = e.Right;
224  Face lf = e.Left;
225  e.DisconnectEdge();
226  foreach (Edge e1 in rf.edges)
227  {
228  e1.Left = lf;
229  }
230  edges.Remove(e);
231  faces.Remove(rf);
232  }
233  }
234 }
Model.Face.NewFace
static Face NewFace()
Definition: Face.cs:30
-
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:26
-
Model.Face.edges
HashSet< Edge > edges
Definition: Face.cs:16
-
Model
Package defining the implementation of the Quad-Edge data structure
Definition: Cell.cs:10
-
Model.Edge.Dest
Vertex Dest
Definition: Edge.cs:85
-
Model.Edge.Dprev
Edge Dprev()
Definition: Edge.cs:372
-
Model.Vertex
Vertex representation in the Quad-Edge data structure.
Definition: Vertex.cs:10
-
Model.Face
Face representation in the Quad-Edge data structure.
Definition: Face.cs:11
-
Model.Edge.Right
Face Right
Definition: Edge.cs:149
-
Model.Vertex.origEdges
List< Edge > origEdges
Definition: Vertex.cs:19
-
Model.Cell
Quad-Edge data structure representing the graph iteself
Definition: Cell.cs:16
-
Model.Vertex.NewVertex
static Vertex NewVertex()
Definition: Vertex.cs:38
-
Model.Edge.ConnectEdge
void ConnectEdge(Vertex orig, Vertex dest, Face left, Face right)
Definition: Edge.cs:206
-
Model.Edge.Left
Face Left
Definition: Edge.cs:116
-
Model.Vertex.destEdges
List< Edge > destEdges
Definition: Vertex.cs:23
-
Model.Edge.DisconnectEdge
void DisconnectEdge()
Definition: Edge.cs:220
-
Model.Edge.Orig
Vertex Orig
Definition: Edge.cs:48
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using System.Linq;
4 using UnityEngine;
5 using Model.Objects;
6 
10 namespace Model
11 {
21  public class Cell
22  {
23  //lists to store verticies, edges, and faces in this cell
24  //if an edge is in the list, then it's companion edges are guaranteed not to be in here
25  List<Vertex> verticies;
26  List<Edge> edges;
27  List<Face> faces;
28 
35  public static Cell MakePrimitiveCell()
36  {
37  Cell c = new Cell();
38  c.verticies = new List<Vertex>();
39  c.verticies.Add(Vertex.NewVertex());
40  c.verticies[0].pos = new Vector3(0, 0, 40);
41  c.verticies.Add(Vertex.NewVertex());
42  c.verticies[1].pos = new Vector3(30, 0, 0);
43  c.verticies.Add(Vertex.NewVertex());
44  c.verticies[2].pos = new Vector3(-20, -20, 0);
45  c.verticies.Add(Vertex.NewVertex());
46  c.verticies[3].pos = new Vector3(-20, 20, 0);
47 
48  c.faces = new List<Face>();
49  c.faces.Add(Face.NewFace());
50  c.faces.Add(Face.NewFace());
51  c.faces.Add(Face.NewFace());
52  c.faces.Add(Face.NewFace());
53 
54  c.edges = Edge.ConnectTetraCell(c.verticies, c.faces);
55  //testing stuff
56  c.makeVertexEdge(c.verticies[0], c.faces[1], c.faces[2]);
57  c.makeFaceEdge(c.faces[2], c.verticies.Last(), c.verticies[2]);
58  //c.killFaceEdge(c.faces.Last(), c.verticies.Last(), c.verticies[2]);
59  //c.killVertexEdge(c.verticies.Last(), c.faces[1], c.faces[2]);
60  return c;
61  }
62 
69  public void calculatePositions(GameObject[] vObjs, GameObject[] eObjs, GameObject[] fObjs)
70  {
71  for (int i = 0; i < verticies.Count; i++)
72  {
73  vObjs[i].transform.position = verticies[i].pos;
74  }
75  for (int i = 0; i < edges.Count; i++)
76  {
77  LineRenderer lr = eObjs[i].GetComponent<LineRenderer>();
78  lr.positionCount = 2;
79  Vertex orig = (edges[i].Orig) as Vertex;
80  Vertex dest = (edges[i].Dest) as Vertex;
81  lr.SetPosition(0, orig.pos);
82  lr.SetPosition(1, dest.pos);
83  }
84  for (int i = 0; i < faces.Count; i++)
85  {
86  //computing center of face
87  LinkedList<Vector3> Vpos = new LinkedList<Vector3>();
88  Vector3 sum = new Vector3(0, 0, 0);
89  Edge start = faces[i].EdgeListHead.Onext();
90  Edge current = start;
91  Vertex prev = faces[i].EdgeListHead.Right as Vertex;
92  do
93  {
94  Vpos.AddLast((current.Right as Vertex).pos); //right should be the vertex that's origin of the edge's dual
95  //the edge's dual edge is a CCW pointing edge bordering faces[i]
96  sum += Vpos.Last();
97  current = current.Onext(); //Onext traversal finds the next edge in CCW dir that points out of face
98  } while (current != start);
99  Vector3 avg = sum / Vpos.Count;
100  Vpos.AddFirst(avg);
101 
102  //construct mesh
103  int j;
104  Vector2[] UVs = new Vector2[Vpos.Count];
105  int[] trigs = new int[3 * (Vpos.Count - 1)]; //-1 to get number of verticies surrounding face = #of trigs
106  float UVstep = 2 * Mathf.PI / Vpos.Count;
107  UVs[0] = new Vector2(0.5f, 0.5f);
108  UVs[1] = new Vector2((Mathf.Cos(UVstep) + 1) / 2, (Mathf.Sin(UVstep) + 1) / 2);
109  trigs[0] = 0;
110  trigs[1] = 1;
111  trigs[2] = 2;
112  for (j = 2; j < Vpos.Count; j++)
113  {
114  UVs[j] = new Vector2((Mathf.Cos(j * UVstep) + 1) / 2, (Mathf.Sin(j * UVstep) + 1) / 2);
115  trigs[3 * (j - 2)] = 0;
116  trigs[3 * (j - 2) + 1] = j - 1;
117  trigs[3 * (j - 2) + 2] = j;
118  }
119  trigs[3 * (j - 2)] = 0;
120  trigs[3 * (j - 2) + 1] = j - 1;
121  trigs[3 * (j - 2) + 2] = 1;
122 
123  Mesh mesh = fObjs[i].GetComponent<MeshFilter>().mesh;
124  mesh.Clear();
125  mesh.vertices = Vpos.ToArray<Vector3>();
126  mesh.uv = UVs;
127  mesh.triangles = trigs;
128  }
129  }
130 
139  public GameObject[][] instantiateGraph(SphereKernel kernel, GameObject vertexObj, GameObject edgeObj, GameObject faceObj)
140  {
141  GameObject[] vObjs = new GameObject[verticies.Count];
142  GameObject[] eObjs = new GameObject[edges.Count];
143  GameObject[] fObjs = new GameObject[faces.Count];
144 
145  for (int i = 0; i < verticies.Count; i++)
146  {
147  vObjs[i] = Object.Instantiate(vertexObj, verticies[i].pos, Quaternion.identity, kernel.gameObject.transform);
148  vObjs[i].GetComponent<VertexObject>().graph = this;
149  vObjs[i].GetComponent<VertexObject>().vertex = verticies[i];
150  vObjs[i].GetComponent<VertexObject>().sphereKernel = kernel;
151 
152  }
153  for (int i = 0; i < edges.Count; i++)
154  {
155  eObjs[i] = Object.Instantiate(edgeObj, Vector3.zero, Quaternion.identity, kernel.gameObject.transform);
156  LineRenderer lr = eObjs[i].GetComponent<LineRenderer>();
157  lr.positionCount = 2;
158  Vertex orig = (edges[i].Orig) as Vertex;
159  Vertex dest = (edges[i].Dest) as Vertex;
160  lr.SetPosition(0, orig.pos);
161  lr.SetPosition(1, dest.pos);
162  }
163  for (int i = 0; i < faces.Count; i++)
164  {
165  //computing center of face
166  LinkedList<Vector3> Vpos = new LinkedList<Vector3>();
167  Vector3 sum = new Vector3(0, 0, 0);
168  Edge start = faces[i].EdgeListHead.Onext();
169  Edge current = start;
170  Vertex prev = faces[i].EdgeListHead.Right as Vertex;
171  do
172  {
173  Vpos.AddLast((current.Right as Vertex).pos); //right should be the vertex that's origin of the edge's dual
174  //the edge's dual edge is a CCW pointing edge bordering faces[i]
175  sum += Vpos.Last();
176  current = current.Onext(); //Onext traversal finds the next edge in CCW dir that points out of face
177  } while (current != start);
178  Vector3 avg = sum / Vpos.Count;
179  Vpos.AddFirst(avg);
180 
181  //construct mesh
182  int j;
183  Vector2[] UVs = new Vector2[Vpos.Count];
184  int[] trigs = new int[3*(Vpos.Count - 1)]; //-1 to get number of verticies surrounding face = #of trigs
185  float UVstep = 2 * Mathf.PI / Vpos.Count;
186  UVs[0] = new Vector2(0.5f, 0.5f);
187  UVs[1] = new Vector2((Mathf.Cos(UVstep) + 1) / 2, (Mathf.Sin(UVstep) + 1) / 2);
188  trigs[0] = 0;
189  trigs[1] = 1;
190  trigs[2] = 2;
191  for(j = 2; j < Vpos.Count; j++)
192  {
193  UVs[j] = new Vector2((Mathf.Cos(j*UVstep)+1)/2, (Mathf.Sin(j*UVstep)+1)/2);
194  trigs[3 * (j - 2)] = 0;
195  trigs[3 * (j - 2) + 1] = j - 1;
196  trigs[3 * (j - 2) + 2] = j;
197  }
198  trigs[3 * (j - 2)] = 0;
199  trigs[3 * (j - 2) + 1] = j - 1;
200  trigs[3 * (j - 2) + 2] = 1;
201 
202  fObjs[i] = Object.Instantiate(faceObj, Vector3.zero, Quaternion.identity, kernel.gameObject.transform);
203  Mesh mesh = fObjs[i].GetComponent<MeshFilter>().mesh;
204  mesh.Clear();
205  mesh.vertices = Vpos.ToArray<Vector3>();
206  mesh.uv = UVs;
207  mesh.triangles = trigs;
208  }
209  return new GameObject[3][] { vObjs, eObjs, fObjs };
210  }
215  public void instantiateTraversals(MonoBehaviour obj, GameObject traverserObj)
216  {
217  GameObject[] tObjs = new GameObject[faces.Count];
218 
219  for (int i = 0; i < faces.Count; i++)
220  {
221  //Instantiate new game object
222  tObjs[i] = Object.Instantiate(traverserObj, obj.gameObject.transform);
223  //Obtain the first available edge
224  Edge oneOfTheEdges = faces[i].EdgeListHead.Rot;
225  //create a new traversal object on first availiable edge
226  tObjs[i].AddComponent<TraversalObject>();
227  tObjs[i].GetComponent<TraversalObject>().AssignTraversalValues(oneOfTheEdges, 0.5F, 0.005F);
228  Vector3 position = tObjs[i].GetComponent<TraversalObject>().getVectorPosition(0.5F);
229  //Translate object with to new position
230  tObjs[i].transform.position = position;
231  }
232  }
233 
245  public Edge makeVertexEdge(Vertex v, Face left, Face right)
246  {
247  //finds all edges that needs to be moved
248  List<Edge> moveE = findMoveEdges(v, left, right);
249 
250  if (moveE == null) return null;
251 
252  Vertex newv = Vertex.NewVertex();
253  Edge newe = Edge.SplitFaceVertex(v, newv, left, right, moveE);
254  verticies.Add(newv);
255  edges.Add(newe);
256  return newe;
257  }
258 
271  public void killVertexEdge(Vertex v, Face left, Face right)
272  {
273  List<Edge> moveE = findMoveEdges(v, left, right);
274  Edge delE = moveE.Last().Onext().Sym;
275  Edge.RejoinFaceVertex(delE.Orig, v, left, right, moveE);
276 
277  if (!edges.Remove(delE))
278  edges.Remove(delE.Sym);
279  verticies.Remove(v);
280  }
281 
294  public Edge makeFaceEdge(Face f, Vertex orig, Vertex dest)
295  {
296  //finds all edges that needs to be moved
297  List<Edge> moveE = findMoveEdges(f, dest, orig);
298 
299  Face newf = Face.NewFace();
300  Edge newe = Edge.SplitFaceVertex(f, newf, dest, orig, moveE);
301  faces.Add(newf);
302  edges.Add(newe.Rot);
303  return newe;
304  }
305 
319  public void killFaceEdge(Face f, Vertex orig, Vertex dest)
320  {
321 
322  List<Edge> moveE = findMoveEdges(f, dest, orig);
323  Edge delE = moveE.Last().Onext().Sym;
324  Edge.RejoinFaceVertex(delE.Orig, f, dest, orig, moveE);
325 
326  if (!edges.Remove(delE.Rot))
327  edges.Remove(delE.InvRot);
328  faces.Remove(f);
329  }
330 
331  //find all edges pointing away from fv
332  //that satisfies:
333  //start at an edge bordering right, find an edge pointing out of fv in a CCW rotation step
334  //repeat until accumulated all edges until the edge bordering left
335  private List<Edge> findMoveEdges(FaceVertex fv, FaceVertex left, FaceVertex right)
336  {
337  Edge temp = fv.EdgeListHead;
338  while (temp.Right != right)
339  {
340  temp = temp.Onext();
341  if (temp == fv.EdgeListHead) //made a loop
342  {
343  return null;
344  }
345  }
346  List<Edge> moveE = new List<Edge>();
347  moveE.Add(temp);
348  while (temp.Left != left)
349  {
350  temp = temp.Onext();
351  moveE.Add(temp);
352  if (temp == moveE[0]) //made a loop
353  {
354  return null;
355  }
356  }
357  if (moveE.Last().Left != (FaceVertex)left)
358  moveE.RemoveAt(moveE.Count - 1);
359 
360  return moveE;
361  }
362  }
363 }
Model.Edge.Rot
Edge Rot
Definition: Edge.cs:59
+ +
Model.Face.NewFace
static Face NewFace()
Definition: FaceVertex.cs:54
+
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:31
+
Model.Edge.ConnectTetraCell
static List< Edge > ConnectTetraCell(List< Vertex > verticies, List< Face > faces)
Definition: Edge.cs:206
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: FaceVertex.cs:64
+
Model.Cell.killFaceEdge
void killFaceEdge(Face f, Vertex orig, Vertex dest)
Definition: Cell.cs:319
+
Model.Edge.Orig
FaceVertex Orig
Definition: Edge.cs:40
+
Model.Cell.instantiateGraph
GameObject [][] instantiateGraph(SphereKernel kernel, GameObject vertexObj, GameObject edgeObj, GameObject faceObj)
Definition: Cell.cs:139
+
Model.Cell.calculatePositions
void calculatePositions(GameObject[] vObjs, GameObject[] eObjs, GameObject[] fObjs)
Definition: Cell.cs:69
+
Model.Edge.RejoinFaceVertex
static void RejoinFaceVertex(FaceVertex oldFV, FaceVertex delFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
Definition: Edge.cs:172
+
Model.Cell.instantiateTraversals
void instantiateTraversals(MonoBehaviour obj, GameObject traverserObj)
Iterate through faces of Cell and create a traversal object for each face
Definition: Cell.cs:215
+
Model.Face
Face representation in the Quad-Edge data structure.
Definition: FaceVertex.cs:45
+
Model.Cell
Quad-Edge data structure representing the graph iteself.
Definition: Cell.cs:21
+
Model.Edge.Sym
Edge Sym
Definition: Edge.cs:64
+
Model.Cell.MakePrimitiveCell
static Cell MakePrimitiveCell()
Definition: Cell.cs:35
+
Model.Vertex.NewVertex
static Vertex NewVertex()
Definition: FaceVertex.cs:78
+
Model.FaceVertex
abstract class for Face and Vertex class.
Definition: FaceVertex.cs:14
+
Model.Cell.makeFaceEdge
Edge makeFaceEdge(Face f, Vertex orig, Vertex dest)
Definition: Cell.cs:294
+
Model.Edge.Right
FaceVertex Right
Definition: Edge.cs:55
+
Model.Edge.Onext
Edge Onext()
Definition: Edge.cs:318
+
Model.Cell.makeVertexEdge
Edge makeVertexEdge(Vertex v, Face left, Face right)
Definition: Cell.cs:245
+
Model.Edge.SplitFaceVertex
static Edge SplitFaceVertex(FaceVertex oldFV, FaceVertex newFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
Definition: Edge.cs:109
+
Model.TraversalObject
Abstract class for objects that will traverse the graph
Definition: TraversalObject.cs:8
+ + +
Model.Edge.InvRot
Edge InvRot
Definition: Edge.cs:69
+
Model.Vertex.pos
Vector3 pos
Definition: FaceVertex.cs:69
+
Model.Edge.Left
FaceVertex Left
Definition: Edge.cs:50
-
Model.Edge.NewEdge
static Edge NewEdge()
Definition: Edge.cs:184
+
Model.Cell.killVertexEdge
void killVertexEdge(Vertex v, Face left, Face right)
Definition: Cell.cs:271
+
diff --git a/Docs/html/_edge_8cs_source.html b/Docs/html/_edge_8cs_source.html index 4c03494..4ca74ee 100644 --- a/Docs/html/_edge_8cs_source.html +++ b/Docs/html/_edge_8cs_source.html @@ -5,7 +5,7 @@ -PlanetCasson: PlanetCasson/Assets/Model/Edge.cs Source File +Planet Casson: Planet Casson/Assets/Model/Edge.cs Source File @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -61,7 +61,7 @@
@@ -69,30 +69,31 @@
Edge.cs
-
1 using System.Collections;
2 using System.Collections.Generic;
3 using System.Linq;
4 using Model;
5 using UnityEngine;
6 
7 namespace Model
8 {
26  public class Edge
27  {
28  private Vertex _orig;
29  private Face _left;
30  private Edge _sym;
31 
47  public Vertex Orig
48  {
49  get { return _orig; }
50  set
51  {
52  if (_orig != null)
53  {
54  _orig.origEdges.Remove(this);
55  _orig.destEdges.Remove(_sym);
56  }
57  _orig = value;
58  if (_orig != null)
59  {
60  _orig.origEdges.Add(this);
61  _orig.destEdges.Add(_sym);
62  }
63  }
64  }
84  public Vertex Dest
85  {
86  get { return _sym._orig; }
87  set
88  {
89  if (_sym._orig != null)
90  {
91  _sym._orig.origEdges.Remove(_sym);
92  _sym._orig.destEdges.Remove(this);
93  }
94  _sym._orig = value;
95  if (_sym._orig != null)
96  {
97  _sym._orig.origEdges.Add(_sym);
98  _sym._orig.destEdges.Add(this);
99  }
100  }
101  }
115  public Face Left
116  {
117  get { return _left; }
118  set
119  {
120  if (_left != null)
121  {
122  _left.edges.Remove(this);
123  _left.edges.Remove(_sym);
124  }
125  _left = value;
126  if (_left != null)
127  {
128  _left.edges.Add(this);
129  _left.edges.Add(_sym);
130  }
131  }
132  }
148  public Face Right
149  {
150  get { return _sym._left; }
151  set
152  {
153  if (_sym._left != null)
154  {
155  _sym._left.edges.Remove(_sym);
156  _sym._left.edges.Remove(this);
157  }
158  _sym._left = value;
159  if (_sym._left != null)
160  {
161  _sym._left.edges.Add(_sym);
162  _sym._left.edges.Add(this);
163  }
164  }
165  }
169  public Edge Sym
170  {
171  get { return _sym; }
172  }
173 
174  //private constructor use NewEdge factory
175  private Edge() { }
176 
184  public static Edge NewEdge()
185  {
186  Edge e1 = new Edge();
187  Edge e2 = new Edge();
188  e1._sym = e2;
189  e2._sym = e1;
190  return e1;
191  }
192 
206  public void ConnectEdge(Vertex orig, Vertex dest, Face left, Face right)
207  {
208  Orig = orig;
209  Dest = dest;
210  Left = left;
211  Right = right;
212  }
213 
220  public void DisconnectEdge()
221  {
222  Orig = null;
223  Dest = null;
224  Left = null;
225  Right = null;
226  }
227 
239  public Edge Rnext()
240  {
241  Right.edges.Remove(Sym);
242  Edge temp = Orig.destEdges.Intersect(Right.edges).FirstOrDefault();
243  Right.edges.Add(Sym);
244  return temp;
245  }
246 
258  public Edge Lnext()
259  {
260  Left.edges.Remove(Sym);
261  Edge temp = Dest.origEdges.Intersect(Left.edges).FirstOrDefault();
262  Left.edges.Add(Sym);
263  return temp;
264  }
265 
277  public Edge Onext()
278  {
279  Left.edges.Remove(this);
280  Edge temp = Orig.origEdges.Intersect(Left.edges).FirstOrDefault();
281  Left.edges.Add(this);
282  return temp;
283  }
284 
296  public Edge Dnext()
297  {
298  Right.edges.Remove(this);
299  Edge temp = Dest.destEdges.Intersect(Right.edges).FirstOrDefault();
300  Right.edges.Add(this);
301  return temp;
302  }
303 
315  public Edge Rprev()
316  {
317  Right.edges.Remove(Sym);
318  Edge temp = Dest.origEdges.Intersect(Right.edges).FirstOrDefault();
319  Right.edges.Add(Sym);
320  return temp;
321  }
322 
334  public Edge Lprev()
335  {
336  Left.edges.Remove(Sym);
337  Edge temp = Orig.destEdges.Intersect(Left.edges).FirstOrDefault();
338  Left.edges.Add(Sym);
339  return temp;
340  }
341 
353  public Edge Oprev()
354  {
355  Right.edges.Remove(this);
356  Edge temp = Orig.origEdges.Intersect(Right.edges).FirstOrDefault();
357  Right.edges.Add(this);
358  return temp;
359  }
360 
372  public Edge Dprev()
373  {
374  Left.edges.Remove(this);
375  Edge temp = Dest.destEdges.Intersect(Left.edges).FirstOrDefault();
376  Left.edges.Add(this);
377  return temp;
378  }
379  }
380 }
Model.Edge.Lprev
Edge Lprev()
Definition: Edge.cs:334
-
Model.Edge.Dnext
Edge Dnext()
Definition: Edge.cs:296
-
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:26
-
Model.Face.edges
HashSet< Edge > edges
Definition: Face.cs:16
-
Model.Edge.Rnext
Edge Rnext()
Definition: Edge.cs:239
-
Model
Package defining the implementation of the Quad-Edge data structure
Definition: Cell.cs:10
-
Model.Edge.Dest
Vertex Dest
Definition: Edge.cs:85
-
Model.Edge.Dprev
Edge Dprev()
Definition: Edge.cs:372
-
Model.Vertex
Vertex representation in the Quad-Edge data structure.
Definition: Vertex.cs:10
-
Model.Edge.Lnext
Edge Lnext()
Definition: Edge.cs:258
-
Model.Face
Face representation in the Quad-Edge data structure.
Definition: Face.cs:11
-
Model.Edge.Right
Face Right
Definition: Edge.cs:149
-
Model.Vertex.origEdges
List< Edge > origEdges
Definition: Vertex.cs:19
-
Model.Edge.Rprev
Edge Rprev()
Definition: Edge.cs:315
-
Model.Edge.Sym
Edge Sym
Definition: Edge.cs:170
-
Model.Edge.Oprev
Edge Oprev()
Definition: Edge.cs:353
-
Model.Edge.Onext
Edge Onext()
Definition: Edge.cs:277
-
Model.Edge.ConnectEdge
void ConnectEdge(Vertex orig, Vertex dest, Face left, Face right)
Definition: Edge.cs:206
-
Model.Edge.Left
Face Left
Definition: Edge.cs:116
-
Model.Vertex.destEdges
List< Edge > destEdges
Definition: Vertex.cs:23
-
Model.Edge.DisconnectEdge
void DisconnectEdge()
Definition: Edge.cs:220
-
Model.Edge.Orig
Vertex Orig
Definition: Edge.cs:48
- -
Model.Edge.NewEdge
static Edge NewEdge()
Definition: Edge.cs:184
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using System.Linq;
4 
5 namespace Model
6 {
31  public class Edge
32  {
33  private FaceVertex _orig;
34  private Edge _rot;
35  private Edge _onext;
36 
40  public FaceVertex Orig { get { return _orig; } }
45  public FaceVertex Dest { get { return Sym._orig; } }
50  public FaceVertex Left { get { return InvRot._orig; } }
55  public FaceVertex Right { get { return Rot._orig; } }
59  public Edge Rot { get { return _rot; } }
64  public Edge Sym { get { return _rot._rot; } }
69  public Edge InvRot { get { return _rot._rot._rot; } }
70 
71  //Helper function for generating an edge that's already linked with its dual edge, symmetric edge, and symmetric dual edge.
72  private static Edge NewEdge()
73  {
74  Edge e1 = new Edge();
75  Edge e2 = new Edge();
76  Edge e3 = new Edge();
77  Edge e4 = new Edge();
78  e1._rot = e3;
79  e2._rot = e4;
80  e3._rot = e2;
81  e4._rot = e1;
82  return e1;
83  }
84 
109  public static Edge SplitFaceVertex(FaceVertex oldFV, FaceVertex newFV, FaceVertex leftFV, FaceVertex rightFV, List<Edge> movedEdges)
110  {
111  //calculating important edges;
112  //movedEdges.Last() should be topLeft
113  //movedEdges[0] should be topRight
114  Edge botLeft = movedEdges.Last().Onext();
115  Edge botRight = movedEdges[0].Oprev();
116  Edge e = NewEdge();
117 
118  //error checking to make sure we don't fuck up the Quad-Edge in Edge insertion
119  if (botLeft.Right != leftFV || botRight.Left != rightFV)
120  throw new System.ArgumentException("inputs presents impossible situation for Vertex Split/Face Subdivide");
121  for (int i = 0; i < movedEdges.Count; i++)
122  {
123  if (movedEdges[i]._orig != oldFV)
124  throw new System.ArgumentException("movedEdges contain invalid edges!");
125  }
126 
127  //moving moveEdges from oldFV to newFV
128  for (int i = 0; i < movedEdges.Count; i++)
129  {
130  movedEdges[i]._orig = newFV;
131  }
132 
133  //linking e with graph
134  e._orig = oldFV;
135  e.Sym._orig = newFV;
136  e.InvRot._orig = leftFV;
137  e.Rot._orig = rightFV;
138 
139  //set EdgeListHead on affected Vertex/Face to eliminate cases where the EdgeListHead is moved from oldFV to newFV
140  oldFV.EdgeListHead = e;
141  newFV.EdgeListHead = e.Sym;
142 
143  //adjusting onext relationship
144  botRight._onext = e;
145  e._onext = botLeft;
146  movedEdges.Last()._onext = e.Sym;
147  e.Sym._onext = movedEdges[0];
148 
149  movedEdges[0].Rot._onext = e.Rot;
150  e.Rot._onext = botRight.InvRot;
151  botLeft.Rot._onext = e.InvRot;
152  e.InvRot._onext = movedEdges.Last().InvRot;
153 
154  return e;
155  }
156 
172  public static void RejoinFaceVertex(FaceVertex oldFV, FaceVertex delFV, FaceVertex leftFV, FaceVertex rightFV, List<Edge> movedEdges)
173  {
174  Edge delE = movedEdges[0].Oprev().Sym;
175  Edge botLeft = delE.Onext();
176  Edge botRight = delE.Oprev();
177 
178  //error checking to make sure we don't fuck up the Quad-Edge in Edge deletion
179  if (botLeft.Right != leftFV || botRight.Left != rightFV)
180  throw new System.ArgumentException("inputs presents impossible situation for Vertex/Face Rejoin");
181  for (int i = 0; i < movedEdges.Count; i++)
182  {
183  if (movedEdges[i]._orig != delFV)
184  throw new System.ArgumentException("movedEdges contain invalid edges!");
185  }
186 
187  for (int i = 0; i < movedEdges.Count; i++)
188  {
189  movedEdges[i]._orig = oldFV;
190  }
191  oldFV.EdgeListHead = movedEdges[0];
192 
193  botRight._onext = movedEdges[0];
194  movedEdges.Last()._onext = botLeft;
195  }
196 
206  public static List<Edge> ConnectTetraCell(List<Vertex> verticies, List<Face> faces)
207  {
208  if (verticies.Count != 4 || faces.Count != 4)
209  throw new System.ArgumentException("Incorrect number of verticies and faces to create a tetrahedron");
210 
211  List<Edge> edges = new List<Edge>();
212  edges.Add(NewEdge());
213  edges.Add(NewEdge());
214  edges.Add(NewEdge());
215  edges.Add(NewEdge());
216  edges.Add(NewEdge());
217  edges.Add(NewEdge());
218 
219  edges[0].ConnectEdge(verticies[0], verticies[1], faces[1], faces[2]);
220  edges[1].ConnectEdge(verticies[0], verticies[2], faces[2], faces[3]);
221  edges[2].ConnectEdge(verticies[0], verticies[3], faces[3], faces[1]);
222 
223  edges[3].ConnectEdge(verticies[1], verticies[2], faces[0], faces[2]);
224  edges[4].ConnectEdge(verticies[2], verticies[3], faces[0], faces[3]);
225  edges[5].ConnectEdge(verticies[3], verticies[1], faces[0], faces[1]);
226 
227  verticies[0].EdgeListHead = edges[2];
228  verticies[1].EdgeListHead = edges[3];
229  verticies[2].EdgeListHead = edges[4];
230  verticies[3].EdgeListHead = edges[5];
231 
232  faces[0].EdgeListHead = edges[3].InvRot;
233  faces[1].EdgeListHead = edges[0].InvRot;
234  faces[2].EdgeListHead = edges[1].InvRot;
235  faces[3].EdgeListHead = edges[2].InvRot;
236 
237  edges[0]._onext = edges[2];
238  edges[2]._onext = edges[1];
239  edges[1]._onext = edges[0];
240 
241  edges[5].Sym._onext = edges[0].Sym;
242  edges[0].Sym._onext = edges[3].Sym;
243  edges[3].Sym._onext = edges[5].Sym;
244 
245  edges[5]._onext = edges[4].Sym;
246  edges[4].Sym._onext = edges[2].Sym;
247  edges[2].Sym._onext = edges[5];
248 
249  edges[3].Sym._onext = edges[1].Sym;
250  edges[1].Sym._onext = edges[4];
251  edges[4]._onext = edges[3].Sym;
252 
253  edges[0].Rot._onext = edges[1].InvRot;
254  edges[1].InvRot._onext = edges[3].Rot;
255  edges[3].Rot._onext = edges[0].Rot;
256 
257  edges[0].InvRot._onext = edges[5].Rot;
258  edges[5].Rot._onext = edges[2].Rot;
259  edges[2].Rot._onext = edges[0].InvRot;
260 
261  edges[2].InvRot._onext = edges[4].Rot;
262  edges[4].Rot._onext = edges[1].Rot;
263  edges[1].Rot._onext = edges[2].InvRot;
264 
265  edges[4].InvRot._onext = edges[5].InvRot;
266  edges[5].InvRot._onext = edges[3].InvRot;
267  edges[3].InvRot._onext = edges[4].InvRot;
268 
269  return edges;
270  }
271 
272  //helper function to link a set of linked edges to its surrounding verticies and faces.
273  private void ConnectEdge(Vertex orig, Vertex dest, Face left, Face right)
274  {
275  _orig = orig;
276  Sym._orig = dest;
277  InvRot._orig = left;
278  Rot._orig = right;
279  }
280 
291  public Edge Rnext()
292  {
293  return Rot.Onext().InvRot;
294  }
295 
306  public Edge Lnext()
307  {
308  return InvRot.Onext().Rot;
309  }
310 
318  public Edge Onext()
319  {
320  return _onext;
321  }
322 
334  public Edge Dnext()
335  {
336  return Rot.Oprev().Rot;
337  }
338 
349  public Edge Rprev()
350  {
351  return Rot.Oprev().InvRot;
352  }
353 
364  public Edge Lprev()
365  {
366  return InvRot.Oprev().Rot;
367  }
368 
379  public Edge Oprev()
380  {
381  return Rot.Onext().Rot;
382  }
383 
394  public Edge Dprev()
395  {
396  return InvRot.Onext().InvRot;
397  }
398  }
399 }
Model.Edge.Lprev
Edge Lprev()
Definition: Edge.cs:364
+
Model.Edge.Rot
Edge Rot
Definition: Edge.cs:59
+
Model.Edge.Dnext
Edge Dnext()
Definition: Edge.cs:334
+
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:31
+
Model.Edge.Rnext
Edge Rnext()
Definition: Edge.cs:291
+
Model.Edge.ConnectTetraCell
static List< Edge > ConnectTetraCell(List< Vertex > verticies, List< Face > faces)
Definition: Edge.cs:206
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Edge.Dprev
Edge Dprev()
Definition: Edge.cs:394
+
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: FaceVertex.cs:64
+
Model.Edge.Orig
FaceVertex Orig
Definition: Edge.cs:40
+
Model.Edge.RejoinFaceVertex
static void RejoinFaceVertex(FaceVertex oldFV, FaceVertex delFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
Definition: Edge.cs:172
+
Model.Edge.Dest
FaceVertex Dest
Definition: Edge.cs:45
+
Model.Edge.Lnext
Edge Lnext()
Definition: Edge.cs:306
+
Model.Face
Face representation in the Quad-Edge data structure.
Definition: FaceVertex.cs:45
+
Model.Edge.Rprev
Edge Rprev()
Definition: Edge.cs:349
+
Model.Edge.Sym
Edge Sym
Definition: Edge.cs:64
+
Model.Edge.Oprev
Edge Oprev()
Definition: Edge.cs:379
+
Model.FaceVertex
abstract class for Face and Vertex class.
Definition: FaceVertex.cs:14
+
Model.Edge.Right
FaceVertex Right
Definition: Edge.cs:55
+
Model.Edge.Onext
Edge Onext()
Definition: Edge.cs:318
+
Model.Edge.SplitFaceVertex
static Edge SplitFaceVertex(FaceVertex oldFV, FaceVertex newFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
Definition: Edge.cs:109
+ +
Model.Edge.InvRot
Edge InvRot
Definition: Edge.cs:69
+
Model.Edge.Left
FaceVertex Left
Definition: Edge.cs:50
diff --git a/Docs/html/_face_8cs_source.html b/Docs/html/_face_8cs_source.html index dbcbe38..8217d0b 100644 --- a/Docs/html/_face_8cs_source.html +++ b/Docs/html/_face_8cs_source.html @@ -69,10 +69,15 @@
Face.cs
-
1 using System.Collections;
2 using System.Collections.Generic;
3 using Model;
4 using UnityEngine;
5 
6 namespace Model
7 {
11  public class Face
12  {
16  public HashSet<Edge> edges;
17 
18  private Face()
19  {
20  edges = new HashSet<Edge>();
21  }
22 
30  public static Face NewFace()
31  {
32  return new Face();
33  }
34  }
35 }
Model.Face.NewFace
static Face NewFace()
Definition: Face.cs:30
-
Model.Face.edges
HashSet< Edge > edges
Definition: Face.cs:16
-
Model
Package defining the implementation of the Quad-Edge data structure
Definition: Cell.cs:10
-
Model.Face
Face representation in the Quad-Edge data structure.
Definition: Face.cs:11
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using Model;
4 using UnityEngine;
5 
6 namespace Model
7 {
11  public class Face : FaceVertex
12  {
16  public Edge EdgeListHead
17  {
18  get { return EdgeListHead.Rot; }
19  set { EdgeListHead = value.InvRot; }
20  }
21 
29  public static Face NewFace()
30  {
31  return new Face();
32  }
33  }
34 }
Model.Edge.Rot
Edge Rot
Definition: Edge.cs:57
+
Model.Face.NewFace
static Face NewFace()
Definition: Face.cs:29
+
Model.Edge
Edge representation in the modified Quad-Edge data structure.
Definition: Edge.cs:29
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Face
Face representation in the modified Quad-Edge data structure.
Definition: Face.cs:11
+
Model.Face.EdgeListHead
Edge EdgeListHead
Definition: Face.cs:17
+
Model.FaceVertex
Interface for Face and Vertex class.
Definition: FaceVertex.cs:12
+
Model.Edge.InvRot
Edge InvRot
Definition: Edge.cs:67
diff --git a/Docs/html/_face_vertex_8cs_source.html b/Docs/html/_face_vertex_8cs_source.html new file mode 100644 index 0000000..85d7062 --- /dev/null +++ b/Docs/html/_face_vertex_8cs_source.html @@ -0,0 +1,91 @@ + + + + + + + +Planet Casson: Planet Casson/Assets/Model/FaceVertex.cs Source File + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
FaceVertex.cs
+
+
+
1 using System;
2 using System.Collections.Generic;
3 using System.Linq;
4 using System.Text;
5 using UnityEngine;
6 
7 namespace Model
8 {
14  public abstract class FaceVertex
15  {
16  private Edge _edgeListHead;
28  public Edge EdgeListHead
29  {
30  get { return _edgeListHead; }
31  set
32  {
33  if (value.Orig == this)
34  _edgeListHead = value;
35  else
36  throw new System.ArgumentException("Edge attempting to make EdgeListHead does not satisfy the correct properties.");
37  }
38  }
39  }
40 
45  public class Face : FaceVertex
46  {
54  public static Face NewFace()
55  {
56  return new Face();
57  }
58  }
59 
64  public class Vertex : FaceVertex
65  {
69  public Vector3 pos;
70 
78  public static Vertex NewVertex()
79  {
80  Vertex v = new Vertex();
81  v.pos = Vector3.zero;
82  return v;
83  }
84  }
85 }
Model.Face.NewFace
static Face NewFace()
Definition: FaceVertex.cs:54
+
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:31
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: FaceVertex.cs:64
+
Model.Face
Face representation in the Quad-Edge data structure.
Definition: FaceVertex.cs:45
+
Model.Vertex.NewVertex
static Vertex NewVertex()
Definition: FaceVertex.cs:78
+
Model.FaceVertex
abstract class for Face and Vertex class.
Definition: FaceVertex.cs:14
+ +
Model.Vertex.pos
Vector3 pos
Definition: FaceVertex.cs:69
+ +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/_sphere_kernel_8cs_source.html b/Docs/html/_sphere_kernel_8cs_source.html index 25b7a00..14b0450 100644 --- a/Docs/html/_sphere_kernel_8cs_source.html +++ b/Docs/html/_sphere_kernel_8cs_source.html @@ -5,7 +5,7 @@ -PlanetCasson: PlanetCasson/Assets/Model/SphereKernel.cs Source File +Planet Casson: Planet Casson/Assets/Model/SphereKernel.cs Source File @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -61,7 +61,7 @@
@@ -69,10 +69,17 @@
SphereKernel.cs
-
1 using System.Collections;
2 using System.Collections.Generic;
3 using UnityEngine;
4 using Model;
5 
6 public class SphereKernel : MonoBehaviour
7 {
8  public GameObject vertexObj;
9  public GameObject edgeObj;
10 
11  //public GameObject asdf;
12 
13  Cell SphereKernelCell;
14 
15  // Use this for initialization
16  void Start()
17  {
18  SphereKernelCell = Cell.MakePrimitiveCell();
19  SphereKernelCell.calculatePositions();
20  SphereKernelCell.instantiateGraph(this, vertexObj, edgeObj);
21  /* Example for adding components
22  asdf = new GameObject();
23  asdf.name = "asdf";
24  asdf.AddComponent<LineRenderer>();
25  */
26  }
27 
28  // Update is called once per frame
29  void Update()
30  {
31 
32  }
33 }
-
Model
Package defining the implementation of the Quad-Edge data structure
Definition: Cell.cs:10
-
Model.Cell
Quad-Edge data structure representing the graph iteself
Definition: Cell.cs:16
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using UnityEngine;
4 using Model;
5 using Model.Objects;
6 
7 public class SphereKernel : MonoBehaviour
8 {
9  public GameObject vertexObj;
10  public GameObject edgeObj;
11  public GameObject faceObj;
12  public GameObject traverserObj;
13 
14  //public GameObject asdf;
15 
16  private Cell SphereKernelCell;
17  private GameObject[] VertexObjects;
18  private GameObject[] EdgeObjects;
19  private GameObject[] FaceObjects;
20 
21  // Use this for initialization
22  void Start()
23  {
24  SphereKernelCell = Cell.MakePrimitiveCell();
25  GameObject[][] tmp = SphereKernelCell.instantiateGraph(this, vertexObj, edgeObj, faceObj);
26  VertexObjects = tmp[0]; EdgeObjects = tmp[1]; FaceObjects = tmp[2];
27  foreach(GameObject vert in VertexObjects) { vert.GetComponent<VertexObject>().live = true; }
28  SphereKernelCell.calculatePositions(VertexObjects, EdgeObjects, FaceObjects);
29  SphereKernelCell.instantiateTraversals(this, traverserObj);
30  /* Example for adding components
31  asdf = new GameObject();
32  asdf.name = "asdf";
33  asdf.AddComponent<LineRenderer>();
34  */
35  }
36 
37  public void recalc()
38  {
39  SphereKernelCell.calculatePositions(VertexObjects, EdgeObjects, FaceObjects);
40  }
41 
42  // Update is called once per frame
43  void Update()
44  {
45 
46  }
47 }
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Cell.instantiateGraph
GameObject [][] instantiateGraph(SphereKernel kernel, GameObject vertexObj, GameObject edgeObj, GameObject faceObj)
Definition: Cell.cs:139
+
Model.Cell.calculatePositions
void calculatePositions(GameObject[] vObjs, GameObject[] eObjs, GameObject[] fObjs)
Definition: Cell.cs:69
+
Model.Cell.instantiateTraversals
void instantiateTraversals(MonoBehaviour obj, GameObject traverserObj)
Iterate through faces of Cell and create a traversal object for each face
Definition: Cell.cs:215
+
Model.Cell
Quad-Edge data structure representing the graph iteself.
Definition: Cell.cs:21
+
Model.Cell.MakePrimitiveCell
static Cell MakePrimitiveCell()
Definition: Cell.cs:35
+ +
diff --git a/Docs/html/_traversal_object_8cs_source.html b/Docs/html/_traversal_object_8cs_source.html new file mode 100644 index 0000000..cb76a4b --- /dev/null +++ b/Docs/html/_traversal_object_8cs_source.html @@ -0,0 +1,93 @@ + + + + + + + +Planet Casson: Planet Casson/Assets/Model/TraversalObject.cs Source File + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
TraversalObject.cs
+
+
+
1 using UnityEngine;
2 
3 namespace Model
4 {
8  public class TraversalObject : MonoBehaviour
9  {
10  //Variables held by each traversal object
11  private Edge _current;
12  //position is a measurement of the percentage of the current edge that the object has travelled
13  private float _pos;
14  //velocity is measured in percentOfEdge/frame
15  private float _vel;
16 
25  public void AssignTraversalValues(Edge currentEdge, float position, float velocity)
26  {
27 
28  _current = currentEdge;
29  _pos = position;
30  _vel = velocity;
31  }
32 
33  public Edge CurrentEdge
34  {
35  get { return _current; }
36  set
37  {
38  _current = value;
39  }
40  }
41  public float Position
42  {
43  get { return _pos; }
44  set
45  {
46  _pos = value;
47  }
48  }
49  public float Velocity
50  {
51  get { return _vel; }
52  set
53  {
54  _vel = value;
55  }
56  }
61  public Vector3 getVectorPosition (float percentPos)
62  {
63  if (_current.Orig is Vertex && _current.Dest is Vertex)
64  {
65  Vertex OrigVertex = (Vertex)_current.Orig;
66  Vertex DestVertex = (Vertex)_current.Dest;
67  //Use Lerp method to linerally interpolate the current position of the of the object
68  return Vector3.Lerp(OrigVertex.pos, DestVertex.pos, percentPos);
69  } else
70  {
71  throw new System.ArgumentException("Traversal Object's _current variable is an edge that doesn't point to vertexes");
72  }
73 
74  }
78  public void Update()
79  {
80  //calculate the new percentage of the edge the object will be at
81  float newPercentPos = _pos + _vel;
82  if (newPercentPos > 1.0)
83  {
84  //object has reached the end of the current edge, move to the next one
85  _current = _current.Lnext();
86  newPercentPos = newPercentPos - 1.0F;
87  }
88  transform.position = getVectorPosition(newPercentPos);
89  _pos = newPercentPos;
90  }
91  }
92 }
Model.Edge
Edge representation in the Quad-Edge data structure.
Definition: Edge.cs:31
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: FaceVertex.cs:64
+
Model.Edge.Orig
FaceVertex Orig
Definition: Edge.cs:40
+
Model.Edge.Dest
FaceVertex Dest
Definition: Edge.cs:45
+
Model.Edge.Lnext
Edge Lnext()
Definition: Edge.cs:306
+
Model.TraversalObject.getVectorPosition
Vector3 getVectorPosition(float percentPos)
Gives position of object as a Vector3
Definition: TraversalObject.cs:61
+
Model.TraversalObject.Update
void Update()
Called by the Unity Engine at every frame. Adjusts the position of the traversal object ...
Definition: TraversalObject.cs:78
+
Model.TraversalObject
Abstract class for objects that will traverse the graph
Definition: TraversalObject.cs:8
+
Model.Vertex.pos
Vector3 pos
Definition: FaceVertex.cs:69
+
Model.TraversalObject.AssignTraversalValues
void AssignTraversalValues(Edge currentEdge, float position, float velocity)
Method used to construct a new traversal object
Definition: TraversalObject.cs:25
+ +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/_vertex_8cs_source.html b/Docs/html/_vertex_8cs_source.html index de15a7e..a283cbd 100644 --- a/Docs/html/_vertex_8cs_source.html +++ b/Docs/html/_vertex_8cs_source.html @@ -69,12 +69,14 @@
Vertex.cs
-
1 using System.Collections;
2 using System.Collections.Generic;
3 using UnityEngine;
4 
5 namespace Model
6 {
10  public class Vertex
11  {
15  public Vector3 pos;
19  public List<Edge> origEdges;
23  public List<Edge> destEdges;
24 
25  private Vertex()
26  {
27  origEdges = new List<Edge>();
28  destEdges = new List<Edge>();
29  }
30 
38  public static Vertex NewVertex()
39  {
40  return new Vertex();
41  }
42  }
43 }
Model
Package defining the implementation of the Quad-Edge data structure
Definition: Cell.cs:10
-
Model.Vertex
Vertex representation in the Quad-Edge data structure.
Definition: Vertex.cs:10
-
Model.Vertex.origEdges
List< Edge > origEdges
Definition: Vertex.cs:19
-
Model.Vertex.NewVertex
static Vertex NewVertex()
Definition: Vertex.cs:38
-
Model.Vertex.destEdges
List< Edge > destEdges
Definition: Vertex.cs:23
-
Model.Vertex.pos
Vector3 pos
Definition: Vertex.cs:15
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using UnityEngine;
4 
5 namespace Model
6 {
10  public class Vertex : FaceVertex
11  {
15  public Edge EdgeListHead
16  {
17  get { return EdgeListHead; }
18  set { EdgeListHead = value; }
19  }
23  public Vector3 pos;
24 
32  public static Vertex NewVertex()
33  {
34  return new Vertex();
35  }
36  }
37 }
Model.Vertex.EdgeListHead
Edge EdgeListHead
Definition: Vertex.cs:16
+
Model.Edge
Edge representation in the modified Quad-Edge data structure.
Definition: Edge.cs:29
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: Vertex.cs:10
+
Model.Vertex.NewVertex
static Vertex NewVertex()
Definition: Vertex.cs:32
+
Model.FaceVertex
Interface for Face and Vertex class.
Definition: FaceVertex.cs:12
+
Model.Vertex.pos
Vector3 pos
Definition: Vertex.cs:23
diff --git a/Docs/html/_vertex_object_8cs_source.html b/Docs/html/_vertex_object_8cs_source.html new file mode 100644 index 0000000..4e32e74 --- /dev/null +++ b/Docs/html/_vertex_object_8cs_source.html @@ -0,0 +1,89 @@ + + + + + + + +Planet Casson: Planet Casson/Assets/Prefab/VertexObject.cs Source File + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
VertexObject.cs
+
+
+
1 using System.Collections;
2 using System.Collections.Generic;
3 using UnityEngine;
4 using UnityEditor;
5 using Model;
6 
7 namespace Model.Objects
8 {
9  public class VertexObject : MonoBehaviour
10  {
11  public Cell graph;
12  public Vertex vertex;
13  public bool live = false;
14  public bool selected = false;
15  internal SphereKernel sphereKernel;
16 
17  // Use this for initialization
18  void Start()
19  {
20 
21  }
22 
23  void OnSelectionChange()
24  {
25  selected = !selected;
26  print("Selected a vertex!");
27  }
28 
29  // Update is called once per frame
30  void Update()
31  {
32  if (live && transform.hasChanged)
33  {
34  vertex.pos = this.gameObject.transform.position;
35  sphereKernel.recalc();
36  transform.hasChanged = false;
37  }
38  //if (Selection.Contains(this.gameObject))
39  // Debug.Log("I'm selected!");
40  }
41  }
42 }
+
Model
Package defining the implementation of the modified Quad-Edge data structure
Definition: Cell.cs:10
+ +
Model.Vertex
Vertex representation in the modified Quad-Edge data structure.
Definition: FaceVertex.cs:64
+ +
Model.Cell
Quad-Edge data structure representing the graph iteself.
Definition: Cell.cs:21
+ +
Model.Vertex.pos
Vector3 pos
Definition: FaceVertex.cs:69
+ +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/annotated.html b/Docs/html/annotated.html index 5eedb64..080e4e4 100644 --- a/Docs/html/annotated.html +++ b/Docs/html/annotated.html @@ -5,7 +5,7 @@ -PlanetCasson: Class List +Planet Casson: Class List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -66,12 +66,16 @@
Here are the classes, structs, unions and interfaces with brief descriptions:
-
[detail level 12]
- - - - - +
[detail level 123]
 ▼NModelPackage defining the implementation of the Quad-Edge data structure
 CCellQuad-Edge data structure representing the graph iteself
 CEdgeEdge representation in the Quad-Edge data structure
 CFaceFace representation in the Quad-Edge data structure.
 CVertexVertex representation in the Quad-Edge data structure.
+ + + + + + + + +
 ▼NModelPackage defining the implementation of the modified Quad-Edge data structure
 ▼NObjects
 CVertexObject
 CCellQuad-Edge data structure representing the graph iteself
 CEdgeEdge representation in the Quad-Edge data structure
 CFaceFace representation in the Quad-Edge data structure
 CFaceVertexabstract class for Face and Vertex class
 CTraversalObjectAbstract class for objects that will traverse the graph
 CVertexVertex representation in the modified Quad-Edge data structure
 CSphereKernel
diff --git a/Docs/html/cellmodification.jpeg b/Docs/html/cellmodification.jpeg new file mode 100644 index 0000000..47447d9 Binary files /dev/null and b/Docs/html/cellmodification.jpeg differ diff --git a/Docs/html/class_model_1_1_cell-members.html b/Docs/html/class_model_1_1_cell-members.html index acd07cc..66b8f2d 100644 --- a/Docs/html/class_model_1_1_cell-members.html +++ b/Docs/html/class_model_1_1_cell-members.html @@ -5,7 +5,7 @@ -PlanetCasson: Member List +Planet Casson: Member List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -72,13 +72,14 @@

This is the complete list of members for Model.Cell, including all inherited members.

- - - - - - - + + + + + + + +
calculatePositions() (defined in Model.Cell)Model.Cell
instantiateGraph(MonoBehaviour obj, GameObject vertexObj, GameObject edgeObj) (defined in Model.Cell)Model.Cell
killFaceEdge(Edge e) (defined in Model.Cell)Model.Cell
killVertexEdge(Vertex v, Face left, Face right) (defined in Model.Cell)Model.Cell
makeFaceEdge(Face f, Vertex orig, Vertex dest) (defined in Model.Cell)Model.Cell
MakePrimitiveCell() (defined in Model.Cell)Model.Cellstatic
makeVertexEdge(Vertex v, Face left, Face right) (defined in Model.Cell)Model.Cell
calculatePositions(GameObject[] vObjs, GameObject[] eObjs, GameObject[] fObjs)Model.Cell
instantiateGraph(SphereKernel kernel, GameObject vertexObj, GameObject edgeObj, GameObject faceObj)Model.Cell
instantiateTraversals(MonoBehaviour obj, GameObject traverserObj)Model.Cell
killFaceEdge(Face f, Vertex orig, Vertex dest)Model.Cell
killVertexEdge(Vertex v, Face left, Face right)Model.Cell
makeFaceEdge(Face f, Vertex orig, Vertex dest)Model.Cell
MakePrimitiveCell()Model.Cellstatic
makeVertexEdge(Vertex v, Face left, Face right)Model.Cell
diff --git a/Docs/html/class_model_1_1_cell.html b/Docs/html/class_model_1_1_cell.html index 5263469..b351b76 100644 --- a/Docs/html/class_model_1_1_cell.html +++ b/Docs/html/class_model_1_1_cell.html @@ -5,7 +5,7 @@ -PlanetCasson: Model.Cell Class Reference +Planet Casson: Model.Cell Class Reference @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -74,42 +74,410 @@
-

Quad-Edge data structure representing the graph iteself +

Quad-Edge data structure representing the graph iteself. More...

- - - - - + + + + + + + + - + - + - - + +

Public Member Functions

-void calculatePositions ()
 
-void instantiateGraph (MonoBehaviour obj, GameObject vertexObj, GameObject edgeObj)
 
-Edge makeVertexEdge (Vertex v, Face left, Face right)
void calculatePositions (GameObject[] vObjs, GameObject[] eObjs, GameObject[] fObjs)
 
GameObject [][] instantiateGraph (SphereKernel kernel, GameObject vertexObj, GameObject edgeObj, GameObject faceObj)
 
void instantiateTraversals (MonoBehaviour obj, GameObject traverserObj)
 Iterate through faces of Cell and create a traversal object for each face More...
 
Edge makeVertexEdge (Vertex v, Face left, Face right)
 
-void killVertexEdge (Vertex v, Face left, Face right)
void killVertexEdge (Vertex v, Face left, Face right)
 
-Edge makeFaceEdge (Face f, Vertex orig, Vertex dest)
Edge makeFaceEdge (Face f, Vertex orig, Vertex dest)
 
-void killFaceEdge (Edge e)
 
void killFaceEdge (Face f, Vertex orig, Vertex dest)
 
- +

Static Public Member Functions

-static Cell MakePrimitiveCell ()
static Cell MakePrimitiveCell ()
 

Detailed Description

-

Quad-Edge data structure representing the graph iteself

+

Quad-Edge data structure representing the graph iteself.

+

The Cell is a Quad-Edge structure that contains a list of edges, verticies, and faces. It is capable of representing all surfaces that are locally homeomorphic to the plane. It is encoded in such a way that it contains both the graph itself and its dual graph. For more details on how this encoding is carried out, see Edge.

+

Benefits of this data structure is the easy and fast access of locality data and the O(1) CW and CCW traversal around points/faces. This second point will be extremely important in our game about CCW traversal on graphs embedded in surfaces.

-

Definition at line 16 of file Cell.cs.

-
The documentation for this class was generated from the following file:

Member Function Documentation

+ +

◆ calculatePositions()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void Model.Cell.calculatePositions (GameObject [] vObjs,
GameObject [] eObjs,
GameObject [] fObjs 
)
+
+ +

+

ben's function, please comment it.

+
Parameters
+ + + + +
vObjs
eObjs
fObjs
+
+
+ +

Definition at line 69 of file Cell.cs.

+ +
+
+ +

◆ instantiateGraph()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
GameObject [][] Model.Cell.instantiateGraph (SphereKernel kernel,
GameObject vertexObj,
GameObject edgeObj,
GameObject faceObj 
)
+
+ +

+

ben's function, please comment it

+
Parameters
+ + + + + +
kernel
vertexObj
edgeObj
faceObj
+
+
+
Returns
+ +

Definition at line 139 of file Cell.cs.

+ +
+
+ +

◆ instantiateTraversals()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void Model.Cell.instantiateTraversals (MonoBehaviour obj,
GameObject traverserObj 
)
+
+ +

Iterate through faces of Cell and create a traversal object for each face

+
Returns
list of traversal objects
+ +

Definition at line 215 of file Cell.cs.

+ +
+
+ +

◆ killFaceEdge()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void Model.Cell.killFaceEdge (Face f,
Vertex orig,
Vertex dest 
)
+
+ +

+

The method of reducing the quad-edge structure. killFaceEdge does the opposite of makeFaceEdge and "rejoins" a subdivided face by deleting the face f and transfers its edges to the face to the left of the edge running from orig to dest.

+

This first finds a list of edges that needs to be moved to the other face, and calls Edge.RejoinFaceVertex with the appropriate parameters.

+

TO utilize RejoinFaceVertex, we pass in arguments to indicate rejoining a vertex corresponding to the face f in the dual graph.

+

If the specified face does not contain an edge running from the orig to dest that also has another face to its right, then an ArgumentException error will be thrown.

+

Note, this might create digons.

+
Parameters
+ + + + +
fThe face to be deleted.
origThe orig of the edge that currently divides the face.
destThe dest of the edge that currently divides the face.
+
+
+ +

Definition at line 319 of file Cell.cs.

+ +
+
+ +

◆ killVertexEdge()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void Model.Cell.killVertexEdge (Vertex v,
Face left,
Face right 
)
+
+ +

+

The method of reducing the quad-edge structure. killVertexEdge does the opposite of makeVertexEdge and "unsplits" a vertex by deleting the vertex v and transfers its edges to the other vertex shared between the left and right faces.

+

This first finds a list of edges that needs to be moved to the other vertex, and calls Edge.RejoinFaceVertex with the appropriate parameters.

+

If the specified left and right faces does not share 2 verticies where one of them is the vertex v, then an ArgumentException error will be thrown.

+

Note, this might create digons.

+
Parameters
+ + + + +
vThe vertex to be deleted.
leftThe face to the left of the vertex.
rightThe face to the right of the vertex.
+
+
+ +

Definition at line 271 of file Cell.cs.

+ +
+
+ +

◆ makeFaceEdge()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
Edge Model.Cell.makeFaceEdge (Face f,
Vertex orig,
Vertex dest 
)
+
+ +

+

The method of expanding from the primitive quad-edge structure. makeFaceEdge subdivides the face "f" into two along an edge that points from orig to dest.

+

This first finds a list of edges that needs to be moved to surround the new face, creates a new, unlinked face, and calls Edge.SplitFaceVertex with the appropriate parameters.

+

To utilize SplitFaceVertex, we pass in arguments to indicate splitting a vertex corresponding to the face f in the dual graph.

+

If the specified face does not contain the verticies orig and dest, an ArgumentException error will be thrown.(uncatched from SplitFaceVertex).

+
Parameters
+ + + + +
fThe face to be subdivided.
origThe origin of the edge to subdivide f.
destThe dest of the edge to subdivide f.
+
+
+
Returns
+ +

Definition at line 294 of file Cell.cs.

+ +
+
+ +

◆ MakePrimitiveCell()

+ +
+
+ + + + + +
+ + + + + + + +
static Cell Model.Cell.MakePrimitiveCell ()
+ 		+static
+
+ +

+

Factory for making the most basic Quad-Edge graph embedded in the sphere, the tetrahedron. This creates the verticies and faces of the tetrahedron and links them together with the Edge.ConnectTetraCell function in Edge.

+

Note that the positions of all the verticies are initialized to zero. after MakePrimitiveCell.

+
Returns
A tetrahedron graph embedded on a sphere. The positions of the verticies are initialized to 0.
+ +

Definition at line 35 of file Cell.cs.

+ +
+
+ +

◆ makeVertexEdge()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
Edge Model.Cell.makeVertexEdge (Vertex v,
Face left,
Face right 
)
+
+ +

+

The method of expanding from the primitive quad-edge structure. makeVertexEdge splits the vertex "v" into two and connect it with an edge whose left face is "left" and right face is "right".

+

This first finds a list of edges that needs to be moved to the new vertex, creates a new, unlinked vertex, and calls Edge.SplitFaceVertex with the appropriate parameters.

+

If the specified left and right face does not share a vertex, an ArgumentException error will be thrown.(uncatched from SplitFaceVertex).

+
Parameters
+ + + + +
vThe vertex to be split.
leftThe face to the left of the vertex.
rightThe face to the right of the vertex.
+
+
+
Returns
An Edge that runs from the old vertex to the new vertex.
+ +

Definition at line 245 of file Cell.cs.

+ +
+
+
The documentation for this class was generated from the following file:
    +
  • Planet Casson/Assets/Model/Cell.cs
diff --git a/Docs/html/class_model_1_1_edge-members.html b/Docs/html/class_model_1_1_edge-members.html index 563780e..8ce4b23 100644 --- a/Docs/html/class_model_1_1_edge-members.html +++ b/Docs/html/class_model_1_1_edge-members.html @@ -5,7 +5,7 @@ -PlanetCasson: Member List +Planet Casson: Member List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -72,21 +72,23 @@

This is the complete list of members for Model.Edge, including all inherited members.

- - - - - - + + + + + + - - - - - + + + + + - + + +
ConnectEdge(Vertex orig, Vertex dest, Face left, Face right)Model.Edge
DestModel.Edge
DisconnectEdge()Model.Edge
Dnext()Model.Edge
Dprev()Model.Edge
LeftModel.Edge
ConnectTetraCell(List< Vertex > verticies, List< Face > faces)Model.Edgestatic
DestModel.Edge
Dnext()Model.Edge
Dprev()Model.Edge
InvRotModel.Edge
LeftModel.Edge
Lnext()Model.Edge
Lprev()Model.Edge
NewEdge()Model.Edgestatic
Onext()Model.Edge
Oprev()Model.Edge
OrigModel.Edge
RightModel.Edge
Onext()Model.Edge
Oprev()Model.Edge
OrigModel.Edge
RejoinFaceVertex(FaceVertex oldFV, FaceVertex delFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)Model.Edgestatic
RightModel.Edge
Rnext()Model.Edge
Rprev()Model.Edge
RotModel.Edge
Rprev()Model.Edge
SplitFaceVertex(FaceVertex oldFV, FaceVertex newFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)Model.Edgestatic
SymModel.Edge
diff --git a/Docs/html/class_model_1_1_edge.html b/Docs/html/class_model_1_1_edge.html index a29e905..7bfdd49 100644 --- a/Docs/html/class_model_1_1_edge.html +++ b/Docs/html/class_model_1_1_edge.html @@ -5,7 +5,7 @@ -PlanetCasson: Model.Edge Class Reference +Planet Casson: Model.Edge Class Reference @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -80,10 +80,6 @@ - - - - @@ -103,72 +99,75 @@

Public Member Functions

void ConnectEdge (Vertex orig, Vertex dest, Face left, Face right)
 
void DisconnectEdge ()
 
Edge Rnext ()
 
Edge Lnext ()
- - + + + + + +

Static Public Member Functions

static Edge NewEdge ()
 
static Edge SplitFaceVertex (FaceVertex oldFV, FaceVertex newFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
 
static void RejoinFaceVertex (FaceVertex oldFV, FaceVertex delFV, FaceVertex leftFV, FaceVertex rightFV, List< Edge > movedEdges)
 
static List< Edge > ConnectTetraCell (List< Vertex > verticies, List< Face > faces)
 
- - - - - - - - + + + + + + + + + + + +

Properties

Vertex Orig [get, set]
 
Vertex Dest [get, set]
 
Face Left [get, set]
 
Face Right [get, set]
 
FaceVertex Orig [get]
 
FaceVertex Dest [get]
 
FaceVertex Left [get]
 
FaceVertex Right [get]
 
Edge Rot [get]
 
Edge Sym [get]
 
Edge InvRot [get]
 

Detailed Description

Edge representation in the Quad-Edge data structure.

-

Each Edge is a directed edge in the Quad-Edge, and also has a corresponding symmetric edge.

-

The following diagram shows the relation between an edge and its symmetric edge:

+

Each Edge is a directed edge in the Quad-Edge, and has a correspinding symmetric edge, dual edge, and symmetric dual edge. We shall call them companion edges.

+

The following diagram shows the relation between an edge and its corresponding edges:

-SymEdges.jpg +SymEdges.JPG
-

The edge and its symmetric edge come together to form an undirected edge. The properties and methods in the Edge class modify both the edge and its symmetric edge. In essense, any modification to an instance of the Edge class is modifying the undirected edge formed from the edge itself and its linked symmetric edge

-

Each Edge, in addition to its symmetric edge, also stores its nearby verticies and faces, which are defined below:

+

The edge and its symmetric edge come together to form an undirected edge. And the dual edge and the symmetric dual edge come together to form an undirected dual edge. The public Methods in the Edge class modify both the undirected edge and the undirected dual edge, and therefore graph and the dual graph simultaneously. In essense, any modification to an instance of the Edge class is modifying all four linked edges.

+

Each directed edge stores only its origin, and a link to its dual edge. When it and its 3 other corresponding edges are linked, the information in the image below can be obtained from each directed edge. See Orig, Dest, Left, Right.

vertface.jpeg
-

Due to the linked nature of an edge and its symmetric edge, only the origin vertex, left face, and symmetric edge needs to be stored. An edge's destination vertex can be gotten from its symmetric edge's origin, and an edge's right face can be gotten from its symmetric edge's right face.

-

This information is used to facilitate the fast edge traversal of the graph through the following functions defined in the image below:

+

In addition to storing the origin and dual edge of each edge, the next edge in the CCW direction whose origin is shared with this directed edge is also stored (see Onext). This information is used to facilitate the fast edge traversal of the graph through the following functions defined in the image below:

edgetraversal.jpeg
-

the last 2 images comes from here. All the credit is theirs

+

Normal Edges have Orig and Dest as verticies and Left and Right as edges. When an edge has its Orig and Dest being faces, or its Left and Right being verticies, that means it is an edge on the dual graph. The relationship between dual edges, dual graphs and their normal graph counterparts is illustrated in the image below. The solid lines depict the normal graph, and the dotted lines depict the corresponding dual graph.

+
+dual.jpeg +
+

Due to the large amount of bookeeping to keep the edge relations valid, only a few functions are available(public) for addition and deletion of edges. SplitFaceVertex, RejoinFaceVertex, ConnectTetraCell.

+

images comes from here. All the credit is theirs

-

Definition at line 26 of file Edge.cs.

+

Definition at line 31 of file Edge.cs.

Member Function Documentation

- -

◆ ConnectEdge()

+ +

◆ ConnectTetraCell()

+ + + +get
- + - - - - - - - - + + - - - - - - - - + + @@ -176,49 +175,26 @@

+static +

+
void Model.Edge.ConnectEdge static List<Edge> Model.Edge.ConnectTetraCell (Vertex orig,
Vertex dest, List< Vertex > verticies,
Face left,
Face right List< Face > faces 

-

This method links the edge to a graph through its adjacent faces and its endpoints. It links both the edge and its symmetric edge to said graph.

-

Example:

-

-Edge e = Edge.NewEdge();
-e.ConnectEdge(v1, v2, f1, f2);
-
Parameters
+

Connects a list of verticies and faces to form the Quad-Edge graph of a tetrahedron. Sets up the initial connections and Onext relationship. This method takes in 4 verticies and 4 faces. If this is not satisfied, an ArgumentException will be thrown.

+
Parameters
- - - - + +
origOrig of the new edge
destDest of the new edge
leftLeft of the new edge
rightRight of the new edge
verticiesList of verticies to be connected.
facesList of faces to be connected.
+
Returns
Returns a list of Edges used to connect the verticies and faces into a tetrahedron. If an edge appears in this list, it's companion edges will not.

Definition at line 206 of file Edge.cs.

-
- - -

◆ DisconnectEdge()

- -
-
- - - - - - - -
void Model.Edge.DisconnectEdge ()
-
- -

-

This method unlinks the edge from the graph it's connected to. It unlinks both the edge and its symmetric edge from said graph. Note that this does not remove it from the edges collection in Cell

-

Cell.edges

- -

Definition at line 220 of file Edge.cs.

-
@@ -237,19 +213,19 @@

-

finds the Edge gotten by one Dnext traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge pointing towards the destination in the CCW direction. from this edge.

It does this by:

  • -Taking all edges pointing to this edge's Dest(see Vertex.destEdges)
    • +Taking the dual edge (see Rot)
  • -Taking all edges boardering this edge's Right(see Face.edges)
    • +Then finding the Oprev)
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its dual edge
Returns
The next Edge in the Dnext traversal
-

Definition at line 296 of file Edge.cs.

+

Definition at line 334 of file Edge.cs.

@@ -269,19 +245,19 @@

-

finds the Edge gotten by one Dprev traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge pointing towards this edge's destination and in a CW direction.

It does this by:

  • -Taking all edges pointing to this edge's Dest(see Vertex.destEdges)
    • +Taking the symmetric dual edge (see InvRot).
  • -Taking all edges boardering this edge's Left(see Face.edges)
    • +Then finding its Onext.
  • -Intersecting them and taking the edge that is not this edge's =Sym
    • +Then taking its symmetrical dual edge.
Returns
The next Edge in the Dprev traversal
-

Definition at line 372 of file Edge.cs.

+

Definition at line 394 of file Edge.cs.

@@ -301,19 +277,19 @@

-

finds the Edge gotten by one Lnext traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge on the face to the left of this edge in a CCW direction. This edge will point away from the destination of this edge

It does this by:

  • -Taking all edges pointing out of this edge's Dest(see Vertex.origEdges)
    • +Taking the symmetric dual edge (see InvRot)
  • -Taking all edges boardering this edge's Left(see Face.edges)
    • +Then finding Onext of it.
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its dual edge(see Rot).
Returns
The next Edge in the Lnext traversal
-

Definition at line 258 of file Edge.cs.

+

Definition at line 306 of file Edge.cs.

@@ -333,62 +309,56 @@

-

finds the Edge gotten by one Lprev traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge on the Face to the left of this edge in a CW direction. This edge will point towards the origin of this edge.

It does this by:

  • -Taking all edges pointing to this edge's Orig(see Vertex.destEdges)
    • +Taking the symmetric dual edge (see InvRot).
  • -Taking all edges boardering this edge's Left(see Face.edges)
    • +Then finding its Oprev.
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its dual edge (see Rot).
Returns
The next Edge in the Lprev traversal
-

Definition at line 334 of file Edge.cs.

+

Definition at line 364 of file Edge.cs.

- -

◆ NewEdge()

+ +

◆ Onext()

- - - - - -
- +
static Edge Model.Edge.NewEdge Edge Model.Edge.Onext ( )
- 		-static

-

Factory for creating new undirected edges. This method creates an edge, and its symmetric edge, and then links them together. The newly created pair of edges are not linked to anything except for each other.

-

To create an undirected edge and then connect it to a graph, see ConnectEdge.

-
Returns
The newly created Edge
+

finds the next Edge pointing out from the origin in the CCW direction. This value is stored in the Edge class, and is initialized with ConnectTetraCell and properly maintained with SplitFaceVertex and RejoinFaceVertex.

+

It does this by:

+
    +
+
Returns
The next Edge in the Onext traversal
-

Definition at line 184 of file Edge.cs.

+

Definition at line 318 of file Edge.cs.

- -

◆ Onext()

+ +

◆ Oprev()

- + @@ -397,51 +367,90 @@

-

finds the Edge gotten by one Onext traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge pointing out of this edge's destination in the CW direction.

It does this by:

  • -Taking all edges pointing out of this edge's Orig(see Vertex.origEdges)
    • +Taking the dual edge (see ).
  • -Taking all edges boardering this edge's Left(see Face.edges)
    • +Then finding its Onext.
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its dual edge.
-
Returns
The next Edge in the Onext traversal
+
Returns
The next Edge in the Oprev traversal
-

Definition at line 277 of file Edge.cs.

+

Definition at line 379 of file Edge.cs.

- -

◆ Oprev()

+ +

◆ RejoinFaceVertex()

+

Edge Model.Edge.Onext Edge Model.Edge.Oprev ( )
+ + + + +
- + - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Edge Model.Edge.Oprev static void Model.Edge.RejoinFaceVertex ()FaceVertex oldFV,
FaceVertex delFV,
FaceVertex leftFV,
FaceVertex rightFV,
List< Edge > movedEdges 
)
+ 		+static

-

finds the Edge gotten by one Oprev traversal step(defined in the image in this class's summary) from this edge.

-

It does this by:

-
    -
  • -Taking all edges pointing out of this edge's Orig(see Vertex.origEdges)
    • -
  • -Taking all edges boardering this edge's Right(see Face.edges)
    • -
  • -Intersecting them and taking the edge that is not this edge's Sym
    • -
-
Returns
The next Edge in the Oprev traversal
+

The reverse of the process described in SplitFaceVertex. This rejoins two verticies of a graph. It is also capable fo rejoining two faces of a graph by rejoining the corresponding verticies of the dual graph.

+

This method moves the origin of all edges in movedEdges from delFV to oldFV. It then sets the FaceVertex.EdgeListHead of oldFV to the first element in movedEdges. Then, it restores proper Onext relationship without the delFV and the edge running from oldFV to delFV. This automatically delinks that edge and delFV, and they will be deleted by the garbage collector.

+

This method checks for the validity of the parameters and whether the vertex split/face subdivide is a valid operation. If not, it will throw and ArgumentException.

+
Parameters
+ + + + + + +
oldFVOld vertex in the graph for movedEdges to all move to after delFV is deleted
delFVVertex to be deleted.
leftFVFace to the left of the directed edge running from oldFV to delFV
rightFVFace to the right of the above defined edge.
movedEdgesList of all edges around delFV except for the one mentioned in leftFV. They required to be in the same order as they are defined in SplitFaceVertex.
+
+
-

Definition at line 353 of file Edge.cs.

+

Definition at line 172 of file Edge.cs.

@@ -461,19 +470,19 @@

-

finds the Edge gotten by one Rnext traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge on the Face to the right of this edge in a CCW direction. This edge will point towards the origin of this edge.

It does this by:

  • -Taking all edges pointing to this edge's Orig(see Vertex.destEdges)
    • +Taking the dual edge(see Rot).
  • -Taking all edges boardering this edge's Right(see Face.edges)
    • +Then finding Onext of it.
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its symmetric dual edge(see InvRot).
-
Returns
The next Edge in the Rnext traversal
+
Returns
The next Edge in the next Rnext
-

Definition at line 239 of file Edge.cs.

+

Definition at line 291 of file Edge.cs.

@@ -493,25 +502,106 @@

-

finds the Edge gotten by one Rprev traversal step(defined in the image in this class's summary) from this edge.

+

finds the next Edge on the Face to the right of this edge in a CW direction. This edge will point out of the destination of this edge.

It does this by:

  • -Taking all edges pointing out of this edge's Dest(see Vertex.origEdges)
    • +Taking the dual edge (see Rot).
  • -Taking all edges boardering this edge's Right(see Face.edges)
    • +Then finding its Oprev.
  • -Intersecting them and taking the edge that is not this edge's Sym
    • +Then taking its symmetrical dual edge (see InvRot).Sym
Returns
The next Edge in the Rprev traversal
-

Definition at line 315 of file Edge.cs.

+

Definition at line 349 of file Edge.cs.

+ + + + +

◆ SplitFaceVertex()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
static Edge Model.Edge.SplitFaceVertex (FaceVertex oldFV,
FaceVertex newFV,
FaceVertex leftFV,
FaceVertex rightFV,
List< Edge > movedEdges 
)
+ 		+static
+
+ +

+

Method for inserting an edge while modifying the surrounding edges, verticies, and faces to preserve the topological properties of the graph.

+

The only method for adding an edge that satisfies this criteria is with the subdivision of a face or splitting a vertex. A subdivision of a face in the graph is the same as the splitting of a vertex in the dual graph. The same also holds true in reverse. This means that although this method is used to split a vertex, it can also subdivide a face by splitting the corresponding vertex in the dual graph.

+
+vertexsplit.JPG +
+

The above picture demonstrates the process of Vertex splitting with the edges in the dotted box representing those in the list movedEdges.

+
+subdivide.JPG +
+

This shows that a subdivision problem(in black) can be solved by doing a vertex split on its dual graph(in gray).

+

Using the inputs, this method moves the origin of all edges in movedEdges from oldFV to newFV. It then sets the FaceVertex.EdgeListHead for the oldFV to a new edge and newFV to the new edge's symmetric edge.(see Sym). This step is to make 100% sure the EdgeListHead has a proper value after the vertex split. Following this, the algorithm then properly links that new edge, its dual, symmetric, and dual symmetric edges to the graph. Finally, it fixes the Onext relationship between the edges and returns this new edge.

+

This method checks for the validity of the parameters and whether the vertex split/face subdivide is a valid operation. If not, it will throw and ArgumentException.

+
Parameters
+ + + + + + +
oldFVOld vertex/face in the graph to be split/subdivided.
newFVNew unlinked FaceVertex object in the graph to be inserted. This FaceVertex must be between leftFV and rightFV.
leftFVFaceVertex in the graph that lies to the left of a directed edge running from oldFV to newFV
rightFVFaceVertex in the graph that lies to the right of said directed edge
movedEdgesList of edges whose origins are centered at oldFV that is to be moved to center at newFV. The list must contain only edges originally facing away from oldFV and are in CCW order. Furthermore, the last edge must be bordering leftFV and the first edge must be bordering rightFV.
+
+
+
Returns
An directed Edge, linked with its 3 other companion edges, that runs from oldFV to newFV
+ +

Definition at line 109 of file Edge.cs.

Property Documentation

- -

◆ Dest

+ +

◆ Dest

@@ -520,37 +610,26 @@

- +
Vertex Model.Edge.DestFaceVertex Model.Edge.Dest

-getset

-

The destination vertex of the edge, and the origin vertex of the corresponding symmetric edge, Sym. On modification of this property, the following actions are taken to maintain the correctness of the Quad-Edge structure.

-
    -
  • -removes Sym from the Vertex.origEdges collection and remove itself from the Vertex.destEdges collection in the Orig of Sym
    • -
  • -replaces the Orig of Sym with the new Dest
    • -
  • -adds Sym to the origEdges collection and adds itself to the destEdges collection in the new Orig of the Sym edge
    • -
-

Note that due to Dest on this edge being just a reference to Orig in Sym, the above steps correctly updates Dest

-

Note that this does not check for the topological or spacial correctness of the operation

-

The remove and addition from/to collections are null checked. This means that it is valid to assign Dest as null

-

Vertex.origEdges Vertex.destEdges Orig Sym

+

Destination of the edge.

+

Gets the origin of the symmetric edge(see Sym).

-

Definition at line 85 of file Edge.cs.

+

Definition at line 45 of file Edge.cs.

- -

◆ Left

+ +

◆ InvRot

@@ -559,36 +638,26 @@

- +
Face Model.Edge.LeftEdge Model.Edge.InvRot
-getset +get

-

The face on the left side of the edge. On modification of this property, the following actions are taken to maintain the correctness of the Quad-Edge structure.

- -

Note that due to Right in Sym being just a reference to Left in this edge, the above steps also correctly updates Right in Sym

-

Note that this does not check for the topological or spacial correctness of the operation

-

The remove and addition from/to collections are null checked. This means that it is valid to assign Left as null

+

Gets the symmetric dual edge.

+

The symmetric dual edge is gotten from taking the dual edge's dual edge's dual edge.

-

Definition at line 116 of file Edge.cs.

+

Definition at line 69 of file Edge.cs.

- -

◆ Orig

+ +

◆ Left

@@ -597,36 +666,26 @@

- +
Vertex Model.Edge.OrigFaceVertex Model.Edge.Left
-getset +get

-

The origin vertex of the edge, and the destination vertex of the corresponding symmetric edge, Sym. On modification of this property, the following actions are taken to maintain the correctness of the Quad-Edge structure.

- -

Note that due to Dest in Sym being just a reference to Orig in this edge, the above steps also correctly updates the Dest in Sym

-

Note that this does not check for the topological or spacial correctness of the operation

-

The remove and addition from/to collections are null checked. This means that it is valid to assign Orig as null

+

Element to the left of the edge.

+

Gets the origin of the symmetric dual edge(see InvRot).

-

Definition at line 48 of file Edge.cs.

+

Definition at line 50 of file Edge.cs.

- -

◆ Right

+ +

◆ Orig

@@ -635,32 +694,75 @@

- +
Face Model.Edge.RightFaceVertex Model.Edge.Orig
-getset +get

-

The face on the right side of the edge. On modification of this property, the following actions are taken to maintain the correctness of the Quad-Edge structure.

- -

Node that due to Right on this edge being just a reference to Left in Sym, the above steps correctly updates Right

-

Note that this does not check for the topological or spacial correctness of the operation

-

The remove and addition from/to collections are null checked. This means that it is valid to assign Right as null

-

Face.edges Sym

+

The origin of this directed edge.

+ +

Definition at line 40 of file Edge.cs.

+ +
+
+ +

◆ Right

+ +
+
+ + + + + +
+ + + + +
FaceVertex Model.Edge.Right
+ 		+get
+
+ +

+

Element to the right of the edge.

+

Gets the origin of the dual edge(see Rot).

+ +

Definition at line 55 of file Edge.cs.

+ +
+
+ +

◆ Rot

+ +
+
+ + + + + +
+ + + + +
Edge Model.Edge.Rot
+ 		+get
+
+ +

+

Gets the dual edge.

-

Definition at line 149 of file Edge.cs.

+

Definition at line 59 of file Edge.cs.

@@ -685,14 +787,15 @@

-

The link to the Symmetric edge of this edge. This property is read-only

+

Gets the symmetric edge.

+

The symmetric edge gotten from taking the dual edge's dual edge.

-

Definition at line 170 of file Edge.cs.

+

Definition at line 64 of file Edge.cs.

The documentation for this class was generated from the following file:
    -
  • PlanetCasson/Assets/Model/Edge.cs
    • +
  • Planet Casson/Assets/Model/Edge.cs
diff --git a/Docs/html/class_model_1_1_face-members.html b/Docs/html/class_model_1_1_face-members.html index f0eb0fb..3dd298e 100644 --- a/Docs/html/class_model_1_1_face-members.html +++ b/Docs/html/class_model_1_1_face-members.html @@ -5,7 +5,7 @@ -PlanetCasson: Member List +Planet Casson: Member List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -72,7 +72,7 @@

This is the complete list of members for Model.Face, including all inherited members.

- +
edgesModel.Face
EdgeListHeadModel.FaceVertex
NewFace()Model.Facestatic
diff --git a/Docs/html/class_model_1_1_face.html b/Docs/html/class_model_1_1_face.html index adf1f94..ff8f34d 100644 --- a/Docs/html/class_model_1_1_face.html +++ b/Docs/html/class_model_1_1_face.html @@ -5,7 +5,7 @@ -PlanetCasson: Model.Face Class Reference +Planet Casson: Model.Face Class Reference @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -67,7 +67,6 @@
Static Public Member Functions | -Public Attributes | List of all members
Model.Face Class Reference
@@ -76,21 +75,32 @@

Face representation in the Quad-Edge data structure. More...

+
+Inheritance diagram for Model.Face:
+
+
+ + +Model.FaceVertex + +

Static Public Member Functions

static Face NewFace ()
 
- - - + + + +

-Public Attributes

HashSet< Edge > edges
 

+Additional Inherited Members

- Properties inherited from Model.FaceVertex
Edge EdgeListHead [get, set]
 

Detailed Description

Face representation in the Quad-Edge data structure.

+

To see how the Edge linkage of the Face is managed, see FaceVertex.

-

Definition at line 11 of file Face.cs.

+

Definition at line 45 of file FaceVertex.cs.

Member Function Documentation

◆ NewFace()

@@ -120,32 +130,12 @@

Face f = Face.NewFace();
Returns
The newly created Face
-

Definition at line 30 of file Face.cs.

- -

-
-

Member Data Documentation

- -

◆ edges

- -
-
- - - - -
HashSet<Edge> Model.Face.edges
-
- -

-

The collection of directed edges(see Edge) that surrounds the face.

- -

Definition at line 16 of file Face.cs.

+

Definition at line 54 of file FaceVertex.cs.

The documentation for this class was generated from the following file: diff --git a/Docs/html/class_model_1_1_face.png b/Docs/html/class_model_1_1_face.png new file mode 100644 index 0000000..895bbd1 Binary files /dev/null and b/Docs/html/class_model_1_1_face.png differ diff --git a/Docs/html/class_model_1_1_face_vertex-members.html b/Docs/html/class_model_1_1_face_vertex-members.html new file mode 100644 index 0000000..6fe05e2 --- /dev/null +++ b/Docs/html/class_model_1_1_face_vertex-members.html @@ -0,0 +1,84 @@ + + + + + + + +Planet Casson: Member List + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Model.FaceVertex Member List
+
+
+ +

This is the complete list of members for Model.FaceVertex, including all inherited members.

+ + +
EdgeListHeadModel.FaceVertex
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_face_vertex.html b/Docs/html/class_model_1_1_face_vertex.html new file mode 100644 index 0000000..4f8f3ce --- /dev/null +++ b/Docs/html/class_model_1_1_face_vertex.html @@ -0,0 +1,144 @@ + + + + + + + +Planet Casson: Model.FaceVertex Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Properties | +List of all members
+
+
Model.FaceVertex Class Reference
+
+
+ +

abstract class for Face and Vertex class. + More...

+
+Inheritance diagram for Model.FaceVertex:
+
+
+ + +Model.Face +Model.Vertex + +
+ + + + +

+Properties

Edge EdgeListHead [get, set]
 
+

Detailed Description

+

abstract class for Face and Vertex class.

+

It is used to express the morphability between Faces and Verticies in a graph and its dual graph. A vertex in the graph is simultaneously a face in the dual graph. The same is true for the face where it is a vertex in the dual graph.

+ +

Definition at line 14 of file FaceVertex.cs.

+

Property Documentation

+ +

◆ EdgeListHead

+ +
+
+ + + + + +
+ + + + +
Edge Model.FaceVertex.EdgeListHead
+ 		+getset
+
+ +

+

When the runtime class is Face:

+

Stores the first dual Edge pointing from the center of the face towards an edge surrounding the face. The dual of this edge is an edge facing CCW direction bordering this face.

+

When the runtime class is Vertex:

+

Stores the first Edge pointing from the center of this vertex.

+

will throw an ArgumentException when the value set for EdgeListHead is not a valid value

+

To find all edges pointing out of the FaceVertex, you can take the edge and traversing in the Onext direction until you encounter the starting edge.

+

Note, this will throw an ArgumentException when the value set for EdgeListHead is not a valid value

+ +

Definition at line 29 of file FaceVertex.cs.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_face_vertex.png b/Docs/html/class_model_1_1_face_vertex.png new file mode 100644 index 0000000..a425940 Binary files /dev/null and b/Docs/html/class_model_1_1_face_vertex.png differ diff --git a/Docs/html/class_model_1_1_objects_1_1_vertex_object-members.html b/Docs/html/class_model_1_1_objects_1_1_vertex_object-members.html new file mode 100644 index 0000000..394a264 --- /dev/null +++ b/Docs/html/class_model_1_1_objects_1_1_vertex_object-members.html @@ -0,0 +1,87 @@ + + + + + + + +Planet Casson: Member List + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Model.Objects.VertexObject Member List
+
+
+ +

This is the complete list of members for Model.Objects.VertexObject, including all inherited members.

+ + + + + +
graph (defined in Model.Objects.VertexObject)Model.Objects.VertexObject
live (defined in Model.Objects.VertexObject)Model.Objects.VertexObject
selected (defined in Model.Objects.VertexObject)Model.Objects.VertexObject
vertex (defined in Model.Objects.VertexObject)Model.Objects.VertexObject
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_objects_1_1_vertex_object.html b/Docs/html/class_model_1_1_objects_1_1_vertex_object.html new file mode 100644 index 0000000..7ee874e --- /dev/null +++ b/Docs/html/class_model_1_1_objects_1_1_vertex_object.html @@ -0,0 +1,113 @@ + + + + + + + +Planet Casson: Model.Objects.VertexObject Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Attributes | +List of all members
+
+
Model.Objects.VertexObject Class Reference
+
+
+
+Inheritance diagram for Model.Objects.VertexObject:
+
+
+ + + +
+ + + + + + + + + + +

+Public Attributes

+Cell graph
 
+Vertex vertex
 
+bool live = false
 
+bool selected = false
 
+

Detailed Description

+
+

Definition at line 9 of file VertexObject.cs.

+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_objects_1_1_vertex_object.png b/Docs/html/class_model_1_1_objects_1_1_vertex_object.png new file mode 100644 index 0000000..e81cd70 Binary files /dev/null and b/Docs/html/class_model_1_1_objects_1_1_vertex_object.png differ diff --git a/Docs/html/class_model_1_1_traversal_object-members.html b/Docs/html/class_model_1_1_traversal_object-members.html new file mode 100644 index 0000000..f81a850 --- /dev/null +++ b/Docs/html/class_model_1_1_traversal_object-members.html @@ -0,0 +1,89 @@ + + + + + + + +Planet Casson: Member List + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Model.TraversalObject Member List
+
+
+ +

This is the complete list of members for Model.TraversalObject, including all inherited members.

+ + + + + + + +
AssignTraversalValues(Edge currentEdge, float position, float velocity)Model.TraversalObject
CurrentEdge (defined in Model.TraversalObject)Model.TraversalObject
getVectorPosition(float percentPos)Model.TraversalObject
Position (defined in Model.TraversalObject)Model.TraversalObject
Update()Model.TraversalObject
Velocity (defined in Model.TraversalObject)Model.TraversalObject
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_traversal_object.html b/Docs/html/class_model_1_1_traversal_object.html new file mode 100644 index 0000000..13eaddc --- /dev/null +++ b/Docs/html/class_model_1_1_traversal_object.html @@ -0,0 +1,220 @@ + + + + + + + +Planet Casson: Model.TraversalObject Class Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Member Functions | +Properties | +List of all members
+
+
Model.TraversalObject Class Reference
+
+
+ +

Abstract class for objects that will traverse the graph + More...

+
+Inheritance diagram for Model.TraversalObject:
+
+
+ + + +
+ + + + + + + + + + + +

+Public Member Functions

void AssignTraversalValues (Edge currentEdge, float position, float velocity)
 Method used to construct a new traversal object More...
 
Vector3 getVectorPosition (float percentPos)
 Gives position of object as a Vector3 More...
 
void Update ()
 Called by the Unity Engine at every frame. Adjusts the position of the traversal object More...
 
+ + + + + + + +

+Properties

+Edge CurrentEdge [get, set]
 
+float Position [get, set]
 
+float Velocity [get, set]
 
+

Detailed Description

+

Abstract class for objects that will traverse the graph

+ +

Definition at line 8 of file TraversalObject.cs.

+

Member Function Documentation

+ +

◆ AssignTraversalValues()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void Model.TraversalObject.AssignTraversalValues (Edge currentEdge,
float position,
float velocity 
)
+
+ +

Method used to construct a new traversal object

+
Parameters
+ + + + + +
faceTravelled
currentEdge
position
velocity
+
+
+
Returns
New traversal object with the properties given in the parameters
+ +

Definition at line 25 of file TraversalObject.cs.

+ +
+
+ +

◆ getVectorPosition()

+ +
+
+ + + + + + + + +
Vector3 Model.TraversalObject.getVectorPosition (float percentPos)
+
+ +

Gives position of object as a Vector3

+
Returns
Vector3 position
+ +

Definition at line 61 of file TraversalObject.cs.

+ +
+
+ +

◆ Update()

+ +
+
+ + + + + + + +
void Model.TraversalObject.Update ()
+
+ +

Called by the Unity Engine at every frame. Adjusts the position of the traversal object

+ +

Definition at line 78 of file TraversalObject.cs.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/class_model_1_1_traversal_object.png b/Docs/html/class_model_1_1_traversal_object.png new file mode 100644 index 0000000..73e3053 Binary files /dev/null and b/Docs/html/class_model_1_1_traversal_object.png differ diff --git a/Docs/html/class_model_1_1_vertex-members.html b/Docs/html/class_model_1_1_vertex-members.html index 6544261..adda273 100644 --- a/Docs/html/class_model_1_1_vertex-members.html +++ b/Docs/html/class_model_1_1_vertex-members.html @@ -5,7 +5,7 @@ -PlanetCasson: Member List +Planet Casson: Member List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -72,10 +72,9 @@

This is the complete list of members for Model.Vertex, including all inherited members.

- + - - +
destEdgesModel.Vertex
EdgeListHeadModel.FaceVertex
NewVertex()Model.Vertexstatic
origEdgesModel.Vertex
posModel.Vertex
posModel.Vertex
diff --git a/Docs/html/class_model_1_1_vertex.html b/Docs/html/class_model_1_1_vertex.html index 22d4343..05412b6 100644 --- a/Docs/html/class_model_1_1_vertex.html +++ b/Docs/html/class_model_1_1_vertex.html @@ -5,7 +5,7 @@ -PlanetCasson: Model.Vertex Class Reference +Planet Casson: Model.Vertex Class Reference @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -74,8 +74,17 @@
-

Vertex representation in the Quad-Edge data structure. +

Vertex representation in the modified Quad-Edge data structure. More...

+
+Inheritance diagram for Model.Vertex:
+
+
+ + +Model.FaceVertex + +
@@ -86,15 +95,18 @@ Public Attributes - - - - +

Static Public Member Functions

Vector3 pos
 
List< Edge > origEdges
 
List< Edge > destEdges
 
+ + + +

+Additional Inherited Members

- Properties inherited from Model.FaceVertex
Edge EdgeListHead [get, set]
 

Detailed Description

-

Vertex representation in the Quad-Edge data structure.

+

Vertex representation in the modified Quad-Edge data structure.

+

To see how the Edge linkage of the Vertex is managed, see FaceVertex.

-

Definition at line 10 of file Vertex.cs.

+

Definition at line 64 of file FaceVertex.cs.

Member Function Documentation

◆ NewVertex()

@@ -120,53 +132,15 @@

-

Factory for creating new verticies. The newly Generated Vertex's position is null and it is not connected to any edges.

+

Factory for creating new verticies. The newly Generated Vertex's position is null and it is not connected to any edges.

Example:

-
Vertex v = Vertex.NewVertex();
Returns
The newly created vertex
+
Vertex v = Vertex.NewVertex();
Returns
The newly created vertex
-

Definition at line 38 of file Vertex.cs.

+

Definition at line 78 of file FaceVertex.cs.

Member Data Documentation

- -

◆ destEdges

- -
-
- - - - -
List<Edge> Model.Vertex.destEdges
-
- -

-

A collection of all directed edges(see Edge) whose origin is at this vertex

- -

Definition at line 23 of file Vertex.cs.

- -
-
- -

◆ origEdges

- -
-
- - - - -
List<Edge> Model.Vertex.origEdges
-
- -

-

A collection of all directed edges(see Edge) whose destination is at this vertex

- -

Definition at line 19 of file Vertex.cs.

- -
-

◆ pos

@@ -182,12 +156,12 @@

Definition at line 15 of file Vertex.cs.

+

Definition at line 69 of file FaceVertex.cs.

The documentation for this class was generated from the following file: diff --git a/Docs/html/class_model_1_1_vertex.png b/Docs/html/class_model_1_1_vertex.png new file mode 100644 index 0000000..30f2b7d Binary files /dev/null and b/Docs/html/class_model_1_1_vertex.png differ diff --git a/Docs/html/class_sphere_kernel-members.html b/Docs/html/class_sphere_kernel-members.html index 93af01d..dc99037 100644 --- a/Docs/html/class_sphere_kernel-members.html +++ b/Docs/html/class_sphere_kernel-members.html @@ -5,7 +5,7 @@ -PlanetCasson: Member List +Planet Casson: Member List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -69,7 +69,10 @@

This is the complete list of members for SphereKernel, including all inherited members.

- + + + +
edgeObj (defined in SphereKernel)SphereKernel
vertexObj (defined in SphereKernel)SphereKernel
faceObj (defined in SphereKernel)SphereKernel
recalc() (defined in SphereKernel)SphereKernel
traverserObj (defined in SphereKernel)SphereKernel
vertexObj (defined in SphereKernel)SphereKernel
diff --git a/Docs/html/class_sphere_kernel.html b/Docs/html/class_sphere_kernel.html index 980b7e9..3bb9753 100644 --- a/Docs/html/class_sphere_kernel.html +++ b/Docs/html/class_sphere_kernel.html @@ -5,7 +5,7 @@ -PlanetCasson: SphereKernel Class Reference +Planet Casson: SphereKernel Class Reference @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -62,6 +62,7 @@
+Public Member Functions | Public Attributes | List of all members
@@ -77,6 +78,12 @@
+ + + +

+Public Member Functions

+void recalc ()
 
+ + + +

Public Attributes

@@ -85,12 +92,18 @@
GameObject edgeObj
 
+GameObject faceObj
 
+GameObject traverserObj
 

Detailed Description

-

Definition at line 6 of file SphereKernel.cs.

+

Definition at line 7 of file SphereKernel.cs.

The documentation for this class was generated from the following file: diff --git a/Docs/html/classes.html b/Docs/html/classes.html index a1b3724..030d97e 100644 --- a/Docs/html/classes.html +++ b/Docs/html/classes.html @@ -5,7 +5,7 @@ -PlanetCasson: Class Index +Planet Casson: Class Index @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -65,19 +65,23 @@
Class Index
-
c | e | f | s | v
+
c | e | f | s | t | v
- - + + + + + +
  c  
-
  e  
  f  
  s  
  v  
-
Cell (Model)   Edge (Model)   Face (Model)   SphereKernel   Vertex (Model)   
Cell (Model)   Face (Model)   SphereKernel   Vertex (Model)   
  e  
+		FaceVertex (Model)   
  t  
+		VertexObject (Model.Objects)   
Edge (Model)   TraversalObject (Model)   
-
c | e | f | s | v
+
c | e | f | s | t | v
diff --git a/Docs/html/dir_667d33e4a798d757f4eac9f1b5ee362b.html b/Docs/html/dir_667d33e4a798d757f4eac9f1b5ee362b.html new file mode 100644 index 0000000..1aceb5e --- /dev/null +++ b/Docs/html/dir_667d33e4a798d757f4eac9f1b5ee362b.html @@ -0,0 +1,80 @@ + + + + + + + +Planet Casson: Planet Casson Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Planet Casson Directory Reference
+
+
+
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/dir_923b98ce0e49104a047ed0b58f9fca67.html b/Docs/html/dir_923b98ce0e49104a047ed0b58f9fca67.html new file mode 100644 index 0000000..98293c4 --- /dev/null +++ b/Docs/html/dir_923b98ce0e49104a047ed0b58f9fca67.html @@ -0,0 +1,80 @@ + + + + + + + +Planet Casson: Planet Casson/Assets/Prefab Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Prefab Directory Reference
+
+
+
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/dir_b23893bfe56f84969830bfcd0325cab7.html b/Docs/html/dir_b23893bfe56f84969830bfcd0325cab7.html new file mode 100644 index 0000000..ff740cf --- /dev/null +++ b/Docs/html/dir_b23893bfe56f84969830bfcd0325cab7.html @@ -0,0 +1,84 @@ + + + + + + + +Planet Casson: Planet Casson/Assets Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Assets Directory Reference
+
+
+ + +

+Directories

+
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/dir_b3d09753b4080a48676315c544630c6b.html b/Docs/html/dir_b3d09753b4080a48676315c544630c6b.html new file mode 100644 index 0000000..350703a --- /dev/null +++ b/Docs/html/dir_b3d09753b4080a48676315c544630c6b.html @@ -0,0 +1,80 @@ + + + + + + + +Planet Casson: Planet Casson/Assets/Model Directory Reference + + + + + + + + + +
+
+ + + + + + +
+
Planet Casson +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
Model Directory Reference
+
+
+
+ +
+Generated by   +doxygen + 1.8.14 +
+ + diff --git a/Docs/html/dual.jpeg b/Docs/html/dual.jpeg new file mode 100644 index 0000000..f92d4d2 Binary files /dev/null and b/Docs/html/dual.jpeg differ diff --git a/Docs/html/files.html b/Docs/html/files.html index 6831c6d..d14affb 100644 --- a/Docs/html/files.html +++ b/Docs/html/files.html @@ -5,7 +5,7 @@ -PlanetCasson: File List +Planet Casson: File List @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -67,14 +67,16 @@
Here is a list of all documented files with brief descriptions:
[detail level 1234]
- - - + + + - + - + + +
 ▼ PlanetCasson
 ▼ Assets
 ▼ Model
 ▼ Planet Casson
 ▼ Assets
 ▼ Model
 Cell.cs
 Edge.cs
 Face.cs
 FaceVertex.cs
 SphereKernel.cs
 Vertex.cs
 TraversalObject.cs
 ▼ Prefab
 VertexObject.cs
diff --git a/Docs/html/functions.html b/Docs/html/functions.html index 2131342..f92aa13 100644 --- a/Docs/html/functions.html +++ b/Docs/html/functions.html @@ -5,7 +5,7 @@ -PlanetCasson: Class Members +Planet Casson: Class Members @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -61,18 +61,28 @@
-
Here is a list of all documented class members with links to the class documentation for each member:
diff --git a/Docs/html/functions_func.html b/Docs/html/functions_func.html index 1431738..27b1a74 100644 --- a/Docs/html/functions_func.html +++ b/Docs/html/functions_func.html @@ -5,7 +5,7 @@ -PlanetCasson: Class Members - Functions +Planet Casson: Class Members - Functions @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -62,11 +62,14 @@
 
diff --git a/Docs/html/functions_prop.html b/Docs/html/functions_prop.html index 4573574..d7767b1 100644 --- a/Docs/html/functions_prop.html +++ b/Docs/html/functions_prop.html @@ -5,7 +5,7 @@ -PlanetCasson: Class Members - Properties +Planet Casson: Class Members - Properties @@ -21,7 +21,7 @@ -
PlanetCasson +
Planet Casson
@@ -63,16 +63,25 @@
 
  • Dest -: Model.Edge +: Model.Edge +
    • +
  • EdgeListHead +: Model.FaceVertex +
    • +
  • InvRot +: Model.Edge
  • Left -: Model.Edge +: Model.Edge
  • Orig -: Model.Edge +: Model.Edge
  • Right -: Model.Edge +: Model.Edge +
    • +
  • Rot +: Model.Edge
  • Sym : Model.Edge diff --git a/Docs/html/functions_vars.html b/Docs/html/functions_vars.html index e3ecf80..ab2a7f0 100644 --- a/Docs/html/functions_vars.html +++ b/Docs/html/functions_vars.html @@ -5,7 +5,7 @@ -PlanetCasson: Class Members - Variables +Planet Casson: Class Members - Variables @@ -21,7 +21,7 @@ -
    PlanetCasson +
    Planet Casson
    @@ -62,15 +62,6 @@
     
    diff --git a/Docs/html/index.html b/Docs/html/index.html index e16ecd7..8a83650 100644 --- a/Docs/html/index.html +++ b/Docs/html/index.html @@ -5,7 +5,7 @@ -PlanetCasson: Main Page +Planet Casson: Main Page @@ -21,7 +21,7 @@ -
    PlanetCasson +
    Planet Casson
    @@ -62,7 +62,7 @@
    -
    PlanetCasson Documentation
    +
    Planet Casson Documentation
    diff --git a/Docs/html/interface_model_1_1_face_vertex-members.html b/Docs/html/interface_model_1_1_face_vertex-members.html new file mode 100644 index 0000000..159bab9 --- /dev/null +++ b/Docs/html/interface_model_1_1_face_vertex-members.html @@ -0,0 +1,84 @@ + + + + + + + +PlanetCasson: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    PlanetCasson +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    Model.FaceVertex Member List
    +
    +
    + +

    This is the complete list of members for Model.FaceVertex, including all inherited members.

    + + +
    EdgeListHead (defined in Model.FaceVertex)Model.FaceVertex
    + +
    +Generated by   +doxygen + 1.8.14 +
    + + diff --git a/Docs/html/interface_model_1_1_face_vertex.html b/Docs/html/interface_model_1_1_face_vertex.html new file mode 100644 index 0000000..66a8fec --- /dev/null +++ b/Docs/html/interface_model_1_1_face_vertex.html @@ -0,0 +1,111 @@ + + + + + + + +PlanetCasson: Model.FaceVertex Interface Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    PlanetCasson +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Properties | +List of all members
    +
    +
    Model.FaceVertex Interface Reference
    +
    +
    + +

    Interface for Face and Vertex class. + More...

    +
    +Inheritance diagram for Model.FaceVertex:
    +
    +
    + + +Model.Face +Model.Vertex + +
    + + + + +

    +Properties

    +Edge EdgeListHead [get, set]
     
    +

    Detailed Description

    +

    Interface for Face and Vertex class.

    +

    It is used to express the morphability between Faces and Verticies in a graph and its dual graph.

    + +

    Definition at line 12 of file FaceVertex.cs.

    +
    The documentation for this interface was generated from the following file: +
    + +
    +Generated by   +doxygen + 1.8.14 +
    + + diff --git a/Docs/html/interface_model_1_1_face_vertex.png b/Docs/html/interface_model_1_1_face_vertex.png new file mode 100644 index 0000000..a425940 Binary files /dev/null and b/Docs/html/interface_model_1_1_face_vertex.png differ diff --git a/Docs/html/menudata.js b/Docs/html/menudata.js index 2855d31..52015be 100644 --- a/Docs/html/menudata.js +++ b/Docs/html/menudata.js @@ -30,7 +30,22 @@ var menudata={children:[ {text:"Class Index",url:"classes.html"}, {text:"Class Hierarchy",url:"hierarchy.html"}, {text:"Class Members",url:"functions.html",children:[ -{text:"All",url:"functions.html"}, +{text:"All",url:"functions.html",children:[ +{text:"a",url:"functions.html#index_a"}, +{text:"c",url:"functions.html#index_c"}, +{text:"d",url:"functions.html#index_d"}, +{text:"e",url:"functions.html#index_e"}, +{text:"g",url:"functions.html#index_g"}, +{text:"i",url:"functions.html#index_i"}, +{text:"k",url:"functions.html#index_k"}, +{text:"l",url:"functions.html#index_l"}, +{text:"m",url:"functions.html#index_m"}, +{text:"n",url:"functions.html#index_n"}, +{text:"o",url:"functions.html#index_o"}, +{text:"p",url:"functions.html#index_p"}, +{text:"r",url:"functions.html#index_r"}, +{text:"s",url:"functions.html#index_s"}, +{text:"u",url:"functions.html#index_u"}]}, {text:"Functions",url:"functions_func.html"}, {text:"Variables",url:"functions_vars.html"}, {text:"Properties",url:"functions_prop.html"}]}]}, diff --git a/Docs/html/namespace_model.html b/Docs/html/namespace_model.html index 32f4029..0b13759 100644 --- a/Docs/html/namespace_model.html +++ b/Docs/html/namespace_model.html @@ -5,7 +5,7 @@ -PlanetCasson: Model Namespace Reference +Planet Casson: Model Namespace Reference @@ -21,7 +21,7 @@ -
    PlanetCasson +
    Planet Casson
    @@ -62,19 +62,23 @@
    +Namespaces | Classes
    Model Namespace Reference
    -

    Package defining the implementation of the Quad-Edge data structure +

    Package defining the implementation of the modified Quad-Edge data structure More...

    + +

    +Namespaces

    - + @@ -82,12 +86,18 @@ + + + + + + - +

    Classes

    class  Cell
     Quad-Edge data structure representing the graph iteself More...
     Quad-Edge data structure representing the graph iteself. More...
     
    class  Edge
     Edge representation in the Quad-Edge data structure. More...
    class  Face
     Face representation in the Quad-Edge data structure. More...
     
    class  FaceVertex
     abstract class for Face and Vertex class. More...
     
    class  TraversalObject
     Abstract class for objects that will traverse the graph More...
     
    class  Vertex
     Vertex representation in the Quad-Edge data structure. More...
     Vertex representation in the modified Quad-Edge data structure. More...
     

    Detailed Description

    -

    Package defining the implementation of the Quad-Edge data structure

    +

    Package defining the implementation of the modified Quad-Edge data structure

    diff --git a/Docs/html/namespace_model_1_1_objects.html b/Docs/html/namespace_model_1_1_objects.html new file mode 100644 index 0000000..c8cc5d6 --- /dev/null +++ b/Docs/html/namespace_model_1_1_objects.html @@ -0,0 +1,88 @@ + + + + + + + +Planet Casson: Model.Objects Namespace Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    Planet Casson +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Classes
    +
    +
    Model.Objects Namespace Reference
    +
    +
    + + + + +

    +Classes

    class  VertexObject
     
    +
    + +
    +Generated by   +doxygen + 1.8.14 +
    + + diff --git a/Docs/html/namespaces.html b/Docs/html/namespaces.html index 385d79c..628d0e9 100644 --- a/Docs/html/namespaces.html +++ b/Docs/html/namespaces.html @@ -5,7 +5,7 @@ -PlanetCasson: Packages +Planet Casson: Packages @@ -21,7 +21,7 @@ -
    PlanetCasson +
    Planet Casson
    @@ -66,8 +66,9 @@
    Here are the packages with brief descriptions (if available):
    - - +
    [detail level 12]
     NModelPackage defining the implementation of the Quad-Edge data structure
    + +
     ▼NModelPackage defining the implementation of the modified Quad-Edge data structure
     NObjects
    diff --git a/Docs/html/search/all_0.js b/Docs/html/search/all_0.js index e5bac75..29edf6b 100644 --- a/Docs/html/search/all_0.js +++ b/Docs/html/search/all_0.js @@ -1,5 +1,4 @@ var searchData= [ - ['cell',['Cell',['../class_model_1_1_cell.html',1,'Model']]], - ['connectedge',['ConnectEdge',['../class_model_1_1_edge.html#aaaf7f7fc35e2cd91ea9a0ec27935f5c8',1,'Model::Edge']]] + ['assigntraversalvalues',['AssignTraversalValues',['../class_model_1_1_traversal_object.html#a9932f18f42519f18440a192830da5e17',1,'Model::TraversalObject']]] ]; diff --git a/Docs/html/search/all_1.js b/Docs/html/search/all_1.js index 825c356..ba25074 100644 --- a/Docs/html/search/all_1.js +++ b/Docs/html/search/all_1.js @@ -1,8 +1,6 @@ var searchData= [ - ['dest',['Dest',['../class_model_1_1_edge.html#a58e256a721f6c2dc581de6d9c38ff88a',1,'Model::Edge']]], - ['destedges',['destEdges',['../class_model_1_1_vertex.html#a5a6374d5019eb4eac1e0ea350da992e5',1,'Model::Vertex']]], - ['disconnectedge',['DisconnectEdge',['../class_model_1_1_edge.html#a5a81156c79d999619598dddcd3777380',1,'Model::Edge']]], - ['dnext',['Dnext',['../class_model_1_1_edge.html#ae7e98804da618ed70720a7304e813d7d',1,'Model::Edge']]], - ['dprev',['Dprev',['../class_model_1_1_edge.html#ad7c5a66e86f4a96ad16181fd2c6f735b',1,'Model::Edge']]] + ['calculatepositions',['calculatePositions',['../class_model_1_1_cell.html#afdff6f600dd3f859be9a5b88aba7ab82',1,'Model::Cell']]], + ['cell',['Cell',['../class_model_1_1_cell.html',1,'Model']]], + ['connecttetracell',['ConnectTetraCell',['../class_model_1_1_edge.html#a80159a241c1c6a510c1cbd1522e59509',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/all_10.html b/Docs/html/search/all_10.html new file mode 100644 index 0000000..50bc449 --- /dev/null +++ b/Docs/html/search/all_10.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_10.js b/Docs/html/search/all_10.js new file mode 100644 index 0000000..284ec71 --- /dev/null +++ b/Docs/html/search/all_10.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['update',['Update',['../class_model_1_1_traversal_object.html#aa4d95fe987aae7830486d5170349d666',1,'Model::TraversalObject']]] +]; diff --git a/Docs/html/search/all_11.html b/Docs/html/search/all_11.html new file mode 100644 index 0000000..b35c8bf --- /dev/null +++ b/Docs/html/search/all_11.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_11.js b/Docs/html/search/all_11.js new file mode 100644 index 0000000..1a4fc70 --- /dev/null +++ b/Docs/html/search/all_11.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['vertex',['Vertex',['../class_model_1_1_vertex.html',1,'Model']]], + ['vertexobject',['VertexObject',['../class_model_1_1_objects_1_1_vertex_object.html',1,'Model::Objects']]] +]; diff --git a/Docs/html/search/all_2.js b/Docs/html/search/all_2.js index 48531f7..b3baa30 100644 --- a/Docs/html/search/all_2.js +++ b/Docs/html/search/all_2.js @@ -1,5 +1,6 @@ var searchData= [ - ['edge',['Edge',['../class_model_1_1_edge.html',1,'Model']]], - ['edges',['edges',['../class_model_1_1_face.html#a7b6cc2c2339c823880cdc896fbe0583b',1,'Model::Face']]] + ['dest',['Dest',['../class_model_1_1_edge.html#ab8c3a6238e4459ba47c158c9a7d5b76b',1,'Model::Edge']]], + ['dnext',['Dnext',['../class_model_1_1_edge.html#ae7e98804da618ed70720a7304e813d7d',1,'Model::Edge']]], + ['dprev',['Dprev',['../class_model_1_1_edge.html#ad7c5a66e86f4a96ad16181fd2c6f735b',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/all_3.js b/Docs/html/search/all_3.js index 51fd1e7..fc8ad50 100644 --- a/Docs/html/search/all_3.js +++ b/Docs/html/search/all_3.js @@ -1,4 +1,5 @@ var searchData= [ - ['face',['Face',['../class_model_1_1_face.html',1,'Model']]] + ['edge',['Edge',['../class_model_1_1_edge.html',1,'Model']]], + ['edgelisthead',['EdgeListHead',['../class_model_1_1_face_vertex.html#a07f0503402fd409cccba3032a58d180f',1,'Model::FaceVertex']]] ]; diff --git a/Docs/html/search/all_4.js b/Docs/html/search/all_4.js index d82dcd4..c8d2ea1 100644 --- a/Docs/html/search/all_4.js +++ b/Docs/html/search/all_4.js @@ -1,6 +1,5 @@ var searchData= [ - ['left',['Left',['../class_model_1_1_edge.html#a4c2fef8a5da26261ef04858e9a601284',1,'Model::Edge']]], - ['lnext',['Lnext',['../class_model_1_1_edge.html#a0f9dd306c2412ec019ea529156f207b0',1,'Model::Edge']]], - ['lprev',['Lprev',['../class_model_1_1_edge.html#ac08616823e3e0c58deda403ca3dc77b8',1,'Model::Edge']]] + ['face',['Face',['../class_model_1_1_face.html',1,'Model']]], + ['facevertex',['FaceVertex',['../class_model_1_1_face_vertex.html',1,'Model']]] ]; diff --git a/Docs/html/search/all_5.js b/Docs/html/search/all_5.js index c7e9110..afb2585 100644 --- a/Docs/html/search/all_5.js +++ b/Docs/html/search/all_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['model',['Model',['../namespace_model.html',1,'']]] + ['getvectorposition',['getVectorPosition',['../class_model_1_1_traversal_object.html#ab0c48eb908b2f6bab5389edef0209b9b',1,'Model::TraversalObject']]] ]; diff --git a/Docs/html/search/all_6.js b/Docs/html/search/all_6.js index 7fc7dc5..6ef3945 100644 --- a/Docs/html/search/all_6.js +++ b/Docs/html/search/all_6.js @@ -1,6 +1,6 @@ var searchData= [ - ['newedge',['NewEdge',['../class_model_1_1_edge.html#a5d90df1900a033aa486df2040389760a',1,'Model::Edge']]], - ['newface',['NewFace',['../class_model_1_1_face.html#acc8e83908df44e0237e7cf3d05cc0f07',1,'Model::Face']]], - ['newvertex',['NewVertex',['../class_model_1_1_vertex.html#a756e520b444aa5ea39f73f193564cf96',1,'Model::Vertex']]] + ['instantiategraph',['instantiateGraph',['../class_model_1_1_cell.html#a8ea2fb59a9aef5d6f4eb22889ae1e3ae',1,'Model::Cell']]], + ['instantiatetraversals',['instantiateTraversals',['../class_model_1_1_cell.html#ae66e399d484e0f8211e479adb8c95561',1,'Model::Cell']]], + ['invrot',['InvRot',['../class_model_1_1_edge.html#aead08adf500d01939981d9a2923d9a2c',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/all_7.js b/Docs/html/search/all_7.js index 699e21e..24a76ee 100644 --- a/Docs/html/search/all_7.js +++ b/Docs/html/search/all_7.js @@ -1,7 +1,5 @@ var searchData= [ - ['onext',['Onext',['../class_model_1_1_edge.html#a8941b72992159cebad8a252b7db4e5f9',1,'Model::Edge']]], - ['oprev',['Oprev',['../class_model_1_1_edge.html#aca6f200525d96c60f2dd24efa62390c7',1,'Model::Edge']]], - ['orig',['Orig',['../class_model_1_1_edge.html#a3a403b86ee003f653bab71d563b47d71',1,'Model::Edge']]], - ['origedges',['origEdges',['../class_model_1_1_vertex.html#a2ca4d619a6a7c4a197254f11002a0223',1,'Model::Vertex']]] + ['killfaceedge',['killFaceEdge',['../class_model_1_1_cell.html#aec16adbae20531528b35ee2080ac46a4',1,'Model::Cell']]], + ['killvertexedge',['killVertexEdge',['../class_model_1_1_cell.html#a80f728a6fbc1f3ab77644c35d1dff553',1,'Model::Cell']]] ]; diff --git a/Docs/html/search/all_8.js b/Docs/html/search/all_8.js index d02ca8f..35320ef 100644 --- a/Docs/html/search/all_8.js +++ b/Docs/html/search/all_8.js @@ -1,4 +1,6 @@ var searchData= [ - ['pos',['pos',['../class_model_1_1_vertex.html#adb523d6ca3e860ac400c05a9a654e155',1,'Model::Vertex']]] + ['left',['Left',['../class_model_1_1_edge.html#a9c11f4202348cca575de310670e1b8e3',1,'Model::Edge']]], + ['lnext',['Lnext',['../class_model_1_1_edge.html#a0f9dd306c2412ec019ea529156f207b0',1,'Model::Edge']]], + ['lprev',['Lprev',['../class_model_1_1_edge.html#ac08616823e3e0c58deda403ca3dc77b8',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/all_9.js b/Docs/html/search/all_9.js index 52378dc..22afb9f 100644 --- a/Docs/html/search/all_9.js +++ b/Docs/html/search/all_9.js @@ -1,6 +1,8 @@ var searchData= [ - ['right',['Right',['../class_model_1_1_edge.html#a69c57f0403cc3ad99a930337464fe1d2',1,'Model::Edge']]], - ['rnext',['Rnext',['../class_model_1_1_edge.html#acebd4cad03a02386b9be44055de2b12a',1,'Model::Edge']]], - ['rprev',['Rprev',['../class_model_1_1_edge.html#afb82ff60f05a7d79f620110853c89290',1,'Model::Edge']]] + ['makefaceedge',['makeFaceEdge',['../class_model_1_1_cell.html#af3958d242d641b77c453f4de189ba020',1,'Model::Cell']]], + ['makeprimitivecell',['MakePrimitiveCell',['../class_model_1_1_cell.html#a66e38e0eaa078a4cb62bb86c71059c8f',1,'Model::Cell']]], + ['makevertexedge',['makeVertexEdge',['../class_model_1_1_cell.html#aa064d1d7613bf7ede0fbd5d9c55dba30',1,'Model::Cell']]], + ['model',['Model',['../namespace_model.html',1,'']]], + ['objects',['Objects',['../namespace_model_1_1_objects.html',1,'Model']]] ]; diff --git a/Docs/html/search/all_a.js b/Docs/html/search/all_a.js index e3ee535..9d1f7e2 100644 --- a/Docs/html/search/all_a.js +++ b/Docs/html/search/all_a.js @@ -1,5 +1,5 @@ var searchData= [ - ['spherekernel',['SphereKernel',['../class_sphere_kernel.html',1,'']]], - ['sym',['Sym',['../class_model_1_1_edge.html#a6370e7f7bc1684929cdea71baef36365',1,'Model::Edge']]] + ['newface',['NewFace',['../class_model_1_1_face.html#acc8e83908df44e0237e7cf3d05cc0f07',1,'Model::Face']]], + ['newvertex',['NewVertex',['../class_model_1_1_vertex.html#a756e520b444aa5ea39f73f193564cf96',1,'Model::Vertex']]] ]; diff --git a/Docs/html/search/all_b.js b/Docs/html/search/all_b.js index 71f9b25..6a881e3 100644 --- a/Docs/html/search/all_b.js +++ b/Docs/html/search/all_b.js @@ -1,4 +1,6 @@ var searchData= [ - ['vertex',['Vertex',['../class_model_1_1_vertex.html',1,'Model']]] + ['onext',['Onext',['../class_model_1_1_edge.html#a8941b72992159cebad8a252b7db4e5f9',1,'Model::Edge']]], + ['oprev',['Oprev',['../class_model_1_1_edge.html#aca6f200525d96c60f2dd24efa62390c7',1,'Model::Edge']]], + ['orig',['Orig',['../class_model_1_1_edge.html#a6b00c9b63678c143f8b99bd9b8cb9f8b',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/all_c.html b/Docs/html/search/all_c.html new file mode 100644 index 0000000..6376810 --- /dev/null +++ b/Docs/html/search/all_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_c.js b/Docs/html/search/all_c.js new file mode 100644 index 0000000..d02ca8f --- /dev/null +++ b/Docs/html/search/all_c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['pos',['pos',['../class_model_1_1_vertex.html#adb523d6ca3e860ac400c05a9a654e155',1,'Model::Vertex']]] +]; diff --git a/Docs/html/search/all_d.html b/Docs/html/search/all_d.html new file mode 100644 index 0000000..cc52c79 --- /dev/null +++ b/Docs/html/search/all_d.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_d.js b/Docs/html/search/all_d.js new file mode 100644 index 0000000..6d27801 --- /dev/null +++ b/Docs/html/search/all_d.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['rejoinfacevertex',['RejoinFaceVertex',['../class_model_1_1_edge.html#a5fb37cdf4de846e847ab490bb1c22c64',1,'Model::Edge']]], + ['right',['Right',['../class_model_1_1_edge.html#af9cedd74d3b26b60e66f302b77870b4a',1,'Model::Edge']]], + ['rnext',['Rnext',['../class_model_1_1_edge.html#acebd4cad03a02386b9be44055de2b12a',1,'Model::Edge']]], + ['rot',['Rot',['../class_model_1_1_edge.html#aa1dcc4ca7b5bbfb94dfe38d4d8dbc680',1,'Model::Edge']]], + ['rprev',['Rprev',['../class_model_1_1_edge.html#afb82ff60f05a7d79f620110853c89290',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/all_e.html b/Docs/html/search/all_e.html new file mode 100644 index 0000000..85b39bd --- /dev/null +++ b/Docs/html/search/all_e.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_e.js b/Docs/html/search/all_e.js new file mode 100644 index 0000000..619e7af --- /dev/null +++ b/Docs/html/search/all_e.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['spherekernel',['SphereKernel',['../class_sphere_kernel.html',1,'']]], + ['splitfacevertex',['SplitFaceVertex',['../class_model_1_1_edge.html#a474ad91ca5b3f0a120522c6970be0c34',1,'Model::Edge']]], + ['sym',['Sym',['../class_model_1_1_edge.html#a6370e7f7bc1684929cdea71baef36365',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/all_f.html b/Docs/html/search/all_f.html new file mode 100644 index 0000000..89fa15a --- /dev/null +++ b/Docs/html/search/all_f.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/all_f.js b/Docs/html/search/all_f.js new file mode 100644 index 0000000..92eed2f --- /dev/null +++ b/Docs/html/search/all_f.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['traversalobject',['TraversalObject',['../class_model_1_1_traversal_object.html',1,'Model']]] +]; diff --git a/Docs/html/search/classes_2.js b/Docs/html/search/classes_2.js index 51fd1e7..c8d2ea1 100644 --- a/Docs/html/search/classes_2.js +++ b/Docs/html/search/classes_2.js @@ -1,4 +1,5 @@ var searchData= [ - ['face',['Face',['../class_model_1_1_face.html',1,'Model']]] + ['face',['Face',['../class_model_1_1_face.html',1,'Model']]], + ['facevertex',['FaceVertex',['../class_model_1_1_face_vertex.html',1,'Model']]] ]; diff --git a/Docs/html/search/classes_4.js b/Docs/html/search/classes_4.js index 71f9b25..92eed2f 100644 --- a/Docs/html/search/classes_4.js +++ b/Docs/html/search/classes_4.js @@ -1,4 +1,4 @@ var searchData= [ - ['vertex',['Vertex',['../class_model_1_1_vertex.html',1,'Model']]] + ['traversalobject',['TraversalObject',['../class_model_1_1_traversal_object.html',1,'Model']]] ]; diff --git a/Docs/html/search/classes_5.html b/Docs/html/search/classes_5.html new file mode 100644 index 0000000..ba8b1c6 --- /dev/null +++ b/Docs/html/search/classes_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/classes_5.js b/Docs/html/search/classes_5.js new file mode 100644 index 0000000..1a4fc70 --- /dev/null +++ b/Docs/html/search/classes_5.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['vertex',['Vertex',['../class_model_1_1_vertex.html',1,'Model']]], + ['vertexobject',['VertexObject',['../class_model_1_1_objects_1_1_vertex_object.html',1,'Model::Objects']]] +]; diff --git a/Docs/html/search/functions_0.js b/Docs/html/search/functions_0.js index b4b0109..29edf6b 100644 --- a/Docs/html/search/functions_0.js +++ b/Docs/html/search/functions_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['connectedge',['ConnectEdge',['../class_model_1_1_edge.html#aaaf7f7fc35e2cd91ea9a0ec27935f5c8',1,'Model::Edge']]] + ['assigntraversalvalues',['AssignTraversalValues',['../class_model_1_1_traversal_object.html#a9932f18f42519f18440a192830da5e17',1,'Model::TraversalObject']]] ]; diff --git a/Docs/html/search/functions_1.js b/Docs/html/search/functions_1.js index 811c98a..e4232e0 100644 --- a/Docs/html/search/functions_1.js +++ b/Docs/html/search/functions_1.js @@ -1,6 +1,5 @@ var searchData= [ - ['disconnectedge',['DisconnectEdge',['../class_model_1_1_edge.html#a5a81156c79d999619598dddcd3777380',1,'Model::Edge']]], - ['dnext',['Dnext',['../class_model_1_1_edge.html#ae7e98804da618ed70720a7304e813d7d',1,'Model::Edge']]], - ['dprev',['Dprev',['../class_model_1_1_edge.html#ad7c5a66e86f4a96ad16181fd2c6f735b',1,'Model::Edge']]] + ['calculatepositions',['calculatePositions',['../class_model_1_1_cell.html#afdff6f600dd3f859be9a5b88aba7ab82',1,'Model::Cell']]], + ['connecttetracell',['ConnectTetraCell',['../class_model_1_1_edge.html#a80159a241c1c6a510c1cbd1522e59509',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/functions_2.js b/Docs/html/search/functions_2.js index 2c6ef6b..05beb95 100644 --- a/Docs/html/search/functions_2.js +++ b/Docs/html/search/functions_2.js @@ -1,5 +1,5 @@ var searchData= [ - ['lnext',['Lnext',['../class_model_1_1_edge.html#a0f9dd306c2412ec019ea529156f207b0',1,'Model::Edge']]], - ['lprev',['Lprev',['../class_model_1_1_edge.html#ac08616823e3e0c58deda403ca3dc77b8',1,'Model::Edge']]] + ['dnext',['Dnext',['../class_model_1_1_edge.html#ae7e98804da618ed70720a7304e813d7d',1,'Model::Edge']]], + ['dprev',['Dprev',['../class_model_1_1_edge.html#ad7c5a66e86f4a96ad16181fd2c6f735b',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/functions_3.js b/Docs/html/search/functions_3.js index 7fc7dc5..afb2585 100644 --- a/Docs/html/search/functions_3.js +++ b/Docs/html/search/functions_3.js @@ -1,6 +1,4 @@ var searchData= [ - ['newedge',['NewEdge',['../class_model_1_1_edge.html#a5d90df1900a033aa486df2040389760a',1,'Model::Edge']]], - ['newface',['NewFace',['../class_model_1_1_face.html#acc8e83908df44e0237e7cf3d05cc0f07',1,'Model::Face']]], - ['newvertex',['NewVertex',['../class_model_1_1_vertex.html#a756e520b444aa5ea39f73f193564cf96',1,'Model::Vertex']]] + ['getvectorposition',['getVectorPosition',['../class_model_1_1_traversal_object.html#ab0c48eb908b2f6bab5389edef0209b9b',1,'Model::TraversalObject']]] ]; diff --git a/Docs/html/search/functions_4.js b/Docs/html/search/functions_4.js index e773772..79f4770 100644 --- a/Docs/html/search/functions_4.js +++ b/Docs/html/search/functions_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['onext',['Onext',['../class_model_1_1_edge.html#a8941b72992159cebad8a252b7db4e5f9',1,'Model::Edge']]], - ['oprev',['Oprev',['../class_model_1_1_edge.html#aca6f200525d96c60f2dd24efa62390c7',1,'Model::Edge']]] + ['instantiategraph',['instantiateGraph',['../class_model_1_1_cell.html#a8ea2fb59a9aef5d6f4eb22889ae1e3ae',1,'Model::Cell']]], + ['instantiatetraversals',['instantiateTraversals',['../class_model_1_1_cell.html#ae66e399d484e0f8211e479adb8c95561',1,'Model::Cell']]] ]; diff --git a/Docs/html/search/functions_5.js b/Docs/html/search/functions_5.js index 3abf74c..24a76ee 100644 --- a/Docs/html/search/functions_5.js +++ b/Docs/html/search/functions_5.js @@ -1,5 +1,5 @@ var searchData= [ - ['rnext',['Rnext',['../class_model_1_1_edge.html#acebd4cad03a02386b9be44055de2b12a',1,'Model::Edge']]], - ['rprev',['Rprev',['../class_model_1_1_edge.html#afb82ff60f05a7d79f620110853c89290',1,'Model::Edge']]] + ['killfaceedge',['killFaceEdge',['../class_model_1_1_cell.html#aec16adbae20531528b35ee2080ac46a4',1,'Model::Cell']]], + ['killvertexedge',['killVertexEdge',['../class_model_1_1_cell.html#a80f728a6fbc1f3ab77644c35d1dff553',1,'Model::Cell']]] ]; diff --git a/Docs/html/search/functions_6.html b/Docs/html/search/functions_6.html new file mode 100644 index 0000000..6fd4b1f --- /dev/null +++ b/Docs/html/search/functions_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_6.js b/Docs/html/search/functions_6.js new file mode 100644 index 0000000..2c6ef6b --- /dev/null +++ b/Docs/html/search/functions_6.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['lnext',['Lnext',['../class_model_1_1_edge.html#a0f9dd306c2412ec019ea529156f207b0',1,'Model::Edge']]], + ['lprev',['Lprev',['../class_model_1_1_edge.html#ac08616823e3e0c58deda403ca3dc77b8',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/functions_7.html b/Docs/html/search/functions_7.html new file mode 100644 index 0000000..6e09abf --- /dev/null +++ b/Docs/html/search/functions_7.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_7.js b/Docs/html/search/functions_7.js new file mode 100644 index 0000000..9cb9ff1 --- /dev/null +++ b/Docs/html/search/functions_7.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['makefaceedge',['makeFaceEdge',['../class_model_1_1_cell.html#af3958d242d641b77c453f4de189ba020',1,'Model::Cell']]], + ['makeprimitivecell',['MakePrimitiveCell',['../class_model_1_1_cell.html#a66e38e0eaa078a4cb62bb86c71059c8f',1,'Model::Cell']]], + ['makevertexedge',['makeVertexEdge',['../class_model_1_1_cell.html#aa064d1d7613bf7ede0fbd5d9c55dba30',1,'Model::Cell']]] +]; diff --git a/Docs/html/search/functions_8.html b/Docs/html/search/functions_8.html new file mode 100644 index 0000000..d59ea97 --- /dev/null +++ b/Docs/html/search/functions_8.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_8.js b/Docs/html/search/functions_8.js new file mode 100644 index 0000000..9d1f7e2 --- /dev/null +++ b/Docs/html/search/functions_8.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['newface',['NewFace',['../class_model_1_1_face.html#acc8e83908df44e0237e7cf3d05cc0f07',1,'Model::Face']]], + ['newvertex',['NewVertex',['../class_model_1_1_vertex.html#a756e520b444aa5ea39f73f193564cf96',1,'Model::Vertex']]] +]; diff --git a/Docs/html/search/functions_9.html b/Docs/html/search/functions_9.html new file mode 100644 index 0000000..5ccec42 --- /dev/null +++ b/Docs/html/search/functions_9.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_9.js b/Docs/html/search/functions_9.js new file mode 100644 index 0000000..e773772 --- /dev/null +++ b/Docs/html/search/functions_9.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['onext',['Onext',['../class_model_1_1_edge.html#a8941b72992159cebad8a252b7db4e5f9',1,'Model::Edge']]], + ['oprev',['Oprev',['../class_model_1_1_edge.html#aca6f200525d96c60f2dd24efa62390c7',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/functions_a.html b/Docs/html/search/functions_a.html new file mode 100644 index 0000000..3958eb7 --- /dev/null +++ b/Docs/html/search/functions_a.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_a.js b/Docs/html/search/functions_a.js new file mode 100644 index 0000000..19e6a5d --- /dev/null +++ b/Docs/html/search/functions_a.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['rejoinfacevertex',['RejoinFaceVertex',['../class_model_1_1_edge.html#a5fb37cdf4de846e847ab490bb1c22c64',1,'Model::Edge']]], + ['rnext',['Rnext',['../class_model_1_1_edge.html#acebd4cad03a02386b9be44055de2b12a',1,'Model::Edge']]], + ['rprev',['Rprev',['../class_model_1_1_edge.html#afb82ff60f05a7d79f620110853c89290',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/functions_b.html b/Docs/html/search/functions_b.html new file mode 100644 index 0000000..b99b702 --- /dev/null +++ b/Docs/html/search/functions_b.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_b.js b/Docs/html/search/functions_b.js new file mode 100644 index 0000000..ab93d1d --- /dev/null +++ b/Docs/html/search/functions_b.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['splitfacevertex',['SplitFaceVertex',['../class_model_1_1_edge.html#a474ad91ca5b3f0a120522c6970be0c34',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/functions_c.html b/Docs/html/search/functions_c.html new file mode 100644 index 0000000..3a33d87 --- /dev/null +++ b/Docs/html/search/functions_c.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/functions_c.js b/Docs/html/search/functions_c.js new file mode 100644 index 0000000..284ec71 --- /dev/null +++ b/Docs/html/search/functions_c.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['update',['Update',['../class_model_1_1_traversal_object.html#aa4d95fe987aae7830486d5170349d666',1,'Model::TraversalObject']]] +]; diff --git a/Docs/html/search/namespaces_0.js b/Docs/html/search/namespaces_0.js index c7e9110..1dd7ccb 100644 --- a/Docs/html/search/namespaces_0.js +++ b/Docs/html/search/namespaces_0.js @@ -1,4 +1,5 @@ var searchData= [ - ['model',['Model',['../namespace_model.html',1,'']]] + ['model',['Model',['../namespace_model.html',1,'']]], + ['objects',['Objects',['../namespace_model_1_1_objects.html',1,'Model']]] ]; diff --git a/Docs/html/search/properties_0.js b/Docs/html/search/properties_0.js index fe05fb3..6a2fabb 100644 --- a/Docs/html/search/properties_0.js +++ b/Docs/html/search/properties_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['dest',['Dest',['../class_model_1_1_edge.html#a58e256a721f6c2dc581de6d9c38ff88a',1,'Model::Edge']]] + ['dest',['Dest',['../class_model_1_1_edge.html#ab8c3a6238e4459ba47c158c9a7d5b76b',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/properties_1.js b/Docs/html/search/properties_1.js index 504cbce..d088d36 100644 --- a/Docs/html/search/properties_1.js +++ b/Docs/html/search/properties_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['left',['Left',['../class_model_1_1_edge.html#a4c2fef8a5da26261ef04858e9a601284',1,'Model::Edge']]] + ['edgelisthead',['EdgeListHead',['../class_model_1_1_face_vertex.html#a07f0503402fd409cccba3032a58d180f',1,'Model::FaceVertex']]] ]; diff --git a/Docs/html/search/properties_2.js b/Docs/html/search/properties_2.js index 0f3cf5c..a4e0389 100644 --- a/Docs/html/search/properties_2.js +++ b/Docs/html/search/properties_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['orig',['Orig',['../class_model_1_1_edge.html#a3a403b86ee003f653bab71d563b47d71',1,'Model::Edge']]] + ['invrot',['InvRot',['../class_model_1_1_edge.html#aead08adf500d01939981d9a2923d9a2c',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/properties_3.js b/Docs/html/search/properties_3.js index 3e212bf..91ea99d 100644 --- a/Docs/html/search/properties_3.js +++ b/Docs/html/search/properties_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['right',['Right',['../class_model_1_1_edge.html#a69c57f0403cc3ad99a930337464fe1d2',1,'Model::Edge']]] + ['left',['Left',['../class_model_1_1_edge.html#a9c11f4202348cca575de310670e1b8e3',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/properties_4.js b/Docs/html/search/properties_4.js index 1404a6c..717283c 100644 --- a/Docs/html/search/properties_4.js +++ b/Docs/html/search/properties_4.js @@ -1,4 +1,4 @@ var searchData= [ - ['sym',['Sym',['../class_model_1_1_edge.html#a6370e7f7bc1684929cdea71baef36365',1,'Model::Edge']]] + ['orig',['Orig',['../class_model_1_1_edge.html#a6b00c9b63678c143f8b99bd9b8cb9f8b',1,'Model::Edge']]] ]; diff --git a/Docs/html/search/properties_5.html b/Docs/html/search/properties_5.html new file mode 100644 index 0000000..8af3319 --- /dev/null +++ b/Docs/html/search/properties_5.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/properties_5.js b/Docs/html/search/properties_5.js new file mode 100644 index 0000000..4c6e035 --- /dev/null +++ b/Docs/html/search/properties_5.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['right',['Right',['../class_model_1_1_edge.html#af9cedd74d3b26b60e66f302b77870b4a',1,'Model::Edge']]], + ['rot',['Rot',['../class_model_1_1_edge.html#aa1dcc4ca7b5bbfb94dfe38d4d8dbc680',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/properties_6.html b/Docs/html/search/properties_6.html new file mode 100644 index 0000000..6662c11 --- /dev/null +++ b/Docs/html/search/properties_6.html @@ -0,0 +1,30 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/Docs/html/search/properties_6.js b/Docs/html/search/properties_6.js new file mode 100644 index 0000000..1404a6c --- /dev/null +++ b/Docs/html/search/properties_6.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['sym',['Sym',['../class_model_1_1_edge.html#a6370e7f7bc1684929cdea71baef36365',1,'Model::Edge']]] +]; diff --git a/Docs/html/search/searchdata.js b/Docs/html/search/searchdata.js index 68c0a71..37dce50 100644 --- a/Docs/html/search/searchdata.js +++ b/Docs/html/search/searchdata.js @@ -1,11 +1,11 @@ var indexSectionsWithContent = { - 0: "cdeflmnoprsv", - 1: "cefsv", + 0: "acdefgiklmnoprstuv", + 1: "cefstv", 2: "m", - 3: "cdlnor", - 4: "deop", - 5: "dlors" + 3: "acdgiklmnorsu", + 4: "p", + 5: "deilors" }; var indexSectionNames = diff --git a/Docs/html/search/variables_0.js b/Docs/html/search/variables_0.js index 392d21d..d02ca8f 100644 --- a/Docs/html/search/variables_0.js +++ b/Docs/html/search/variables_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['destedges',['destEdges',['../class_model_1_1_vertex.html#a5a6374d5019eb4eac1e0ea350da992e5',1,'Model::Vertex']]] + ['pos',['pos',['../class_model_1_1_vertex.html#adb523d6ca3e860ac400c05a9a654e155',1,'Model::Vertex']]] ]; diff --git a/Docs/html/subdivide.JPG b/Docs/html/subdivide.JPG new file mode 100644 index 0000000..04a2930 Binary files /dev/null and b/Docs/html/subdivide.JPG differ diff --git a/Docs/html/vertexsplit.JPG b/Docs/html/vertexsplit.JPG new file mode 100644 index 0000000..aad64a8 Binary files /dev/null and b/Docs/html/vertexsplit.JPG differ diff --git a/Doxyfile b/Doxyfile new file mode 100644 index 0000000..cbaa333 --- /dev/null +++ b/Doxyfile @@ -0,0 +1,2511 @@ +# Doxyfile 1.8.14 + +# This file describes the settings to be used by the documentation system +# doxygen (www.doxygen.org) for a project. +# +# All text after a double hash (##) is considered a comment and is placed in +# front of the TAG it is preceding. +# +# All text after a single hash (#) is considered a comment and will be ignored. +# The format is: +# TAG = value [value, ...] +# For lists, items can also be appended using: +# TAG += value [value, ...] +# Values that contain spaces should be placed between quotes (\" \"). + +#--------------------------------------------------------------------------- +# Project related configuration options +#--------------------------------------------------------------------------- + +# This tag specifies the encoding used for all characters in the config file +# that follow. The default is UTF-8 which is also the encoding used for all text +# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv +# built into libc) for the transcoding. See +# https://www.gnu.org/software/libiconv/ for the list of possible encodings. +# The default value is: UTF-8. + +DOXYFILE_ENCODING = UTF-8 + +# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by +# double-quotes, unless you are using Doxywizard) that should identify the +# project for which the documentation is generated. This name is used in the +# title of most generated pages and in a few other places. +# The default value is: My Project. + +PROJECT_NAME = "Planet Casson" + +# The PROJECT_NUMBER tag can be used to enter a project or revision number. This +# could be handy for archiving the generated documentation or if some version +# control system is used. + +PROJECT_NUMBER = + +# Using the PROJECT_BRIEF tag one can provide an optional one line description +# for a project that appears at the top of each page and should give viewer a +# quick idea about the purpose of the project. Keep the description short. + +PROJECT_BRIEF = + +# With the PROJECT_LOGO tag one can specify a logo or an icon that is included +# in the documentation. The maximum height of the logo should not exceed 55 +# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy +# the logo to the output directory. + +PROJECT_LOGO = + +# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path +# into which the generated documentation will be written. If a relative path is +# entered, it will be relative to the location where doxygen was started. If +# left blank the current directory will be used. + +OUTPUT_DIRECTORY = "C:\Users\Zelin Tong\Desktop\Spring 2018\Comp585\Game\Docs" + +# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub- +# directories (in 2 levels) under the output directory of each output format and +# will distribute the generated files over these directories. Enabling this +# option can be useful when feeding doxygen a huge amount of source files, where +# putting all generated files in the same directory would otherwise causes +# performance problems for the file system. +# The default value is: NO. + +CREATE_SUBDIRS = NO + +# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII +# characters to appear in the names of generated files. If set to NO, non-ASCII +# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode +# U+3044. +# The default value is: NO. + +ALLOW_UNICODE_NAMES = NO + +# The OUTPUT_LANGUAGE tag is used to specify the language in which all +# documentation generated by doxygen is written. Doxygen will use this +# information to generate all constant output in the proper language. +# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese, +# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States), +# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian, +# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages), +# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian, +# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian, +# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish, +# Ukrainian and Vietnamese. +# The default value is: English. + +OUTPUT_LANGUAGE = English + +# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member +# descriptions after the members that are listed in the file and class +# documentation (similar to Javadoc). Set to NO to disable this. +# The default value is: YES. + +BRIEF_MEMBER_DESC = YES + +# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief +# description of a member or function before the detailed description +# +# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the +# brief descriptions will be completely suppressed. +# The default value is: YES. + +REPEAT_BRIEF = YES + +# This tag implements a quasi-intelligent brief description abbreviator that is +# used to form the text in various listings. Each string in this list, if found +# as the leading text of the brief description, will be stripped from the text +# and the result, after processing the whole list, is used as the annotated +# text. Otherwise, the brief description is used as-is. If left blank, the +# following values are used ($name is automatically replaced with the name of +# the entity):The $name class, The $name widget, The $name file, is, provides, +# specifies, contains, represents, a, an and the. + +ABBREVIATE_BRIEF = "The $name class" \ + "The $name widget" \ + "The $name file" \ + is \ + provides \ + specifies \ + contains \ + represents \ + a \ + an \ + the + +# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then +# doxygen will generate a detailed section even if there is only a brief +# description. +# The default value is: NO. + +ALWAYS_DETAILED_SEC = NO + +# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all +# inherited members of a class in the documentation of that class as if those +# members were ordinary class members. Constructors, destructors and assignment +# operators of the base classes will not be shown. +# The default value is: NO. + +INLINE_INHERITED_MEMB = NO + +# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path +# before files name in the file list and in the header files. If set to NO the +# shortest path that makes the file name unique will be used +# The default value is: YES. + +FULL_PATH_NAMES = YES + +# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path. +# Stripping is only done if one of the specified strings matches the left-hand +# part of the path. The tag can be used to show relative paths in the file list. +# If left blank the directory from which doxygen is run is used as the path to +# strip. +# +# Note that you can specify absolute paths here, but also relative paths, which +# will be relative from the directory where doxygen is started. +# This tag requires that the tag FULL_PATH_NAMES is set to YES. + +STRIP_FROM_PATH = + +# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the +# path mentioned in the documentation of a class, which tells the reader which +# header file to include in order to use a class. If left blank only the name of +# the header file containing the class definition is used. Otherwise one should +# specify the list of include paths that are normally passed to the compiler +# using the -I flag. + +STRIP_FROM_INC_PATH = + +# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but +# less readable) file names. This can be useful is your file systems doesn't +# support long names like on DOS, Mac, or CD-ROM. +# The default value is: NO. + +SHORT_NAMES = NO + +# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the +# first line (until the first dot) of a Javadoc-style comment as the brief +# description. If set to NO, the Javadoc-style will behave just like regular Qt- +# style comments (thus requiring an explicit @brief command for a brief +# description.) +# The default value is: NO. + +JAVADOC_AUTOBRIEF = NO + +# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first +# line (until the first dot) of a Qt-style comment as the brief description. If +# set to NO, the Qt-style will behave just like regular Qt-style comments (thus +# requiring an explicit \brief command for a brief description.) +# The default value is: NO. + +QT_AUTOBRIEF = NO + +# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a +# multi-line C++ special comment block (i.e. a block of //! or /// comments) as +# a brief description. This used to be the default behavior. The new default is +# to treat a multi-line C++ comment block as a detailed description. Set this +# tag to YES if you prefer the old behavior instead. +# +# Note that setting this tag to YES also means that rational rose comments are +# not recognized any more. +# The default value is: NO. + +MULTILINE_CPP_IS_BRIEF = NO + +# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the +# documentation from any documented member that it re-implements. +# The default value is: YES. + +INHERIT_DOCS = YES + +# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new +# page for each member. If set to NO, the documentation of a member will be part +# of the file/class/namespace that contains it. +# The default value is: NO. + +SEPARATE_MEMBER_PAGES = NO + +# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen +# uses this value to replace tabs by spaces in code fragments. +# Minimum value: 1, maximum value: 16, default value: 4. + +TAB_SIZE = 4 + +# This tag can be used to specify a number of aliases that act as commands in +# the documentation. An alias has the form: +# name=value +# For example adding +# "sideeffect=@par Side Effects:\n" +# will allow you to put the command \sideeffect (or @sideeffect) in the +# documentation, which will result in a user-defined paragraph with heading +# "Side Effects:". You can put \n's in the value part of an alias to insert +# newlines. + +ALIASES = + +# This tag can be used to specify a number of word-keyword mappings (TCL only). +# A mapping has the form "name=value". For example adding "class=itcl::class" +# will allow you to use the command class in the itcl::class meaning. + +TCL_SUBST = + +# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources +# only. Doxygen will then generate output that is more tailored for C. For +# instance, some of the names that are used will be different. The list of all +# members will be omitted, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_FOR_C = NO + +# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or +# Python sources only. Doxygen will then generate output that is more tailored +# for that language. For instance, namespaces will be presented as packages, +# qualified scopes will look different, etc. +# The default value is: NO. + +OPTIMIZE_OUTPUT_JAVA = YES + +# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran +# sources. Doxygen will then generate output that is tailored for Fortran. +# The default value is: NO. + +OPTIMIZE_FOR_FORTRAN = NO + +# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL +# sources. Doxygen will then generate output that is tailored for VHDL. +# The default value is: NO. + +OPTIMIZE_OUTPUT_VHDL = NO + +# Doxygen selects the parser to use depending on the extension of the files it +# parses. With this tag you can assign which parser to use for a given +# extension. Doxygen has a built-in mapping, but you can override or extend it +# using this tag. The format is ext=language, where ext is a file extension, and +# language is one of the parsers supported by doxygen: IDL, Java, Javascript, +# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran: +# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran: +# Fortran. In the later case the parser tries to guess whether the code is fixed +# or free formatted code, this is the default for Fortran type files), VHDL. For +# instance to make doxygen treat .inc files as Fortran files (default is PHP), +# and .f files as C (default is Fortran), use: inc=Fortran f=C. +# +# Note: For files without extension you can use no_extension as a placeholder. +# +# Note that for custom extensions you also need to set FILE_PATTERNS otherwise +# the files are not read by doxygen. + +EXTENSION_MAPPING = + +# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments +# according to the Markdown format, which allows for more readable +# documentation. See http://daringfireball.net/projects/markdown/ for details. +# The output of markdown processing is further processed by doxygen, so you can +# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in +# case of backward compatibilities issues. +# The default value is: YES. + +MARKDOWN_SUPPORT = YES + +# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up +# to that level are automatically included in the table of contents, even if +# they do not have an id attribute. +# Note: This feature currently applies only to Markdown headings. +# Minimum value: 0, maximum value: 99, default value: 0. +# This tag requires that the tag MARKDOWN_SUPPORT is set to YES. + +TOC_INCLUDE_HEADINGS = 0 + +# When enabled doxygen tries to link words that correspond to documented +# classes, or namespaces to their corresponding documentation. Such a link can +# be prevented in individual cases by putting a % sign in front of the word or +# globally by setting AUTOLINK_SUPPORT to NO. +# The default value is: YES. + +AUTOLINK_SUPPORT = YES + +# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want +# to include (a tag file for) the STL sources as input, then you should set this +# tag to YES in order to let doxygen match functions declarations and +# definitions whose arguments contain STL classes (e.g. func(std::string); +# versus func(std::string) {}). This also make the inheritance and collaboration +# diagrams that involve STL classes more complete and accurate. +# The default value is: NO. + +BUILTIN_STL_SUPPORT = NO + +# If you use Microsoft's C++/CLI language, you should set this option to YES to +# enable parsing support. +# The default value is: NO. + +CPP_CLI_SUPPORT = NO + +# Set the SIP_SUPPORT tag to YES if your project consists of sip (see: +# https://www.riverbankcomputing.com/software/sip/intro) sources only. Doxygen +# will parse them like normal C++ but will assume all classes use public instead +# of private inheritance when no explicit protection keyword is present. +# The default value is: NO. + +SIP_SUPPORT = NO + +# For Microsoft's IDL there are propget and propput attributes to indicate +# getter and setter methods for a property. Setting this option to YES will make +# doxygen to replace the get and set methods by a property in the documentation. +# This will only work if the methods are indeed getting or setting a simple +# type. If this is not the case, or you want to show the methods anyway, you +# should set this option to NO. +# The default value is: YES. + +IDL_PROPERTY_SUPPORT = YES + +# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC +# tag is set to YES then doxygen will reuse the documentation of the first +# member in the group (if any) for the other members of the group. By default +# all members of a group must be documented explicitly. +# The default value is: NO. + +DISTRIBUTE_GROUP_DOC = NO + +# If one adds a struct or class to a group and this option is enabled, then also +# any nested class or struct is added to the same group. By default this option +# is disabled and one has to add nested compounds explicitly via \ingroup. +# The default value is: NO. + +GROUP_NESTED_COMPOUNDS = NO + +# Set the SUBGROUPING tag to YES to allow class member groups of the same type +# (for instance a group of public functions) to be put as a subgroup of that +# type (e.g. under the Public Functions section). Set it to NO to prevent +# subgrouping. Alternatively, this can be done per class using the +# \nosubgrouping command. +# The default value is: YES. + +SUBGROUPING = YES + +# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions +# are shown inside the group in which they are included (e.g. using \ingroup) +# instead of on a separate page (for HTML and Man pages) or section (for LaTeX +# and RTF). +# +# Note that this feature does not work in combination with +# SEPARATE_MEMBER_PAGES. +# The default value is: NO. + +INLINE_GROUPED_CLASSES = NO + +# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions +# with only public data fields or simple typedef fields will be shown inline in +# the documentation of the scope in which they are defined (i.e. file, +# namespace, or group documentation), provided this scope is documented. If set +# to NO, structs, classes, and unions are shown on a separate page (for HTML and +# Man pages) or section (for LaTeX and RTF). +# The default value is: NO. + +INLINE_SIMPLE_STRUCTS = NO + +# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or +# enum is documented as struct, union, or enum with the name of the typedef. So +# typedef struct TypeS {} TypeT, will appear in the documentation as a struct +# with name TypeT. When disabled the typedef will appear as a member of a file, +# namespace, or class. And the struct will be named TypeS. This can typically be +# useful for C code in case the coding convention dictates that all compound +# types are typedef'ed and only the typedef is referenced, never the tag name. +# The default value is: NO. + +TYPEDEF_HIDES_STRUCT = NO + +# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This +# cache is used to resolve symbols given their name and scope. Since this can be +# an expensive process and often the same symbol appears multiple times in the +# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small +# doxygen will become slower. If the cache is too large, memory is wasted. The +# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range +# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536 +# symbols. At the end of a run doxygen will report the cache usage and suggest +# the optimal cache size from a speed point of view. +# Minimum value: 0, maximum value: 9, default value: 0. + +LOOKUP_CACHE_SIZE = 0 + +#--------------------------------------------------------------------------- +# Build related configuration options +#--------------------------------------------------------------------------- + +# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in +# documentation are documented, even if no documentation was available. Private +# class members and static file members will be hidden unless the +# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES. +# Note: This will also disable the warnings about undocumented members that are +# normally produced when WARNINGS is set to YES. +# The default value is: NO. + +EXTRACT_ALL = NO + +# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will +# be included in the documentation. +# The default value is: NO. + +EXTRACT_PRIVATE = NO + +# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal +# scope will be included in the documentation. +# The default value is: NO. + +EXTRACT_PACKAGE = NO + +# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be +# included in the documentation. +# The default value is: NO. + +EXTRACT_STATIC = NO + +# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined +# locally in source files will be included in the documentation. If set to NO, +# only classes defined in header files are included. Does not have any effect +# for Java sources. +# The default value is: YES. + +EXTRACT_LOCAL_CLASSES = YES + +# This flag is only useful for Objective-C code. If set to YES, local methods, +# which are defined in the implementation section but not in the interface are +# included in the documentation. If set to NO, only methods in the interface are +# included. +# The default value is: NO. + +EXTRACT_LOCAL_METHODS = NO + +# If this flag is set to YES, the members of anonymous namespaces will be +# extracted and appear in the documentation as a namespace called +# 'anonymous_namespace{file}', where file will be replaced with the base name of +# the file that contains the anonymous namespace. By default anonymous namespace +# are hidden. +# The default value is: NO. + +EXTRACT_ANON_NSPACES = NO + +# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all +# undocumented members inside documented classes or files. If set to NO these +# members will be included in the various overviews, but no documentation +# section is generated. This option has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_MEMBERS = NO + +# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all +# undocumented classes that are normally visible in the class hierarchy. If set +# to NO, these classes will be included in the various overviews. This option +# has no effect if EXTRACT_ALL is enabled. +# The default value is: NO. + +HIDE_UNDOC_CLASSES = NO + +# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend +# (class|struct|union) declarations. If set to NO, these declarations will be +# included in the documentation. +# The default value is: NO. + +HIDE_FRIEND_COMPOUNDS = NO + +# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any +# documentation blocks found inside the body of a function. If set to NO, these +# blocks will be appended to the function's detailed documentation block. +# The default value is: NO. + +HIDE_IN_BODY_DOCS = NO + +# The INTERNAL_DOCS tag determines if documentation that is typed after a +# \internal command is included. If the tag is set to NO then the documentation +# will be excluded. Set it to YES to include the internal documentation. +# The default value is: NO. + +INTERNAL_DOCS = NO + +# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file +# names in lower-case letters. If set to YES, upper-case letters are also +# allowed. This is useful if you have classes or files whose names only differ +# in case and if your file system supports case sensitive file names. Windows +# and Mac users are advised to set this option to NO. +# The default value is: system dependent. + +CASE_SENSE_NAMES = NO + +# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with +# their full class and namespace scopes in the documentation. If set to YES, the +# scope will be hidden. +# The default value is: NO. + +HIDE_SCOPE_NAMES = NO + +# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will +# append additional text to a page's title, such as Class Reference. If set to +# YES the compound reference will be hidden. +# The default value is: NO. + +HIDE_COMPOUND_REFERENCE= NO + +# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of +# the files that are included by a file in the documentation of that file. +# The default value is: YES. + +SHOW_INCLUDE_FILES = YES + +# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each +# grouped member an include statement to the documentation, telling the reader +# which file to include in order to use the member. +# The default value is: NO. + +SHOW_GROUPED_MEMB_INC = NO + +# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include +# files with double quotes in the documentation rather than with sharp brackets. +# The default value is: NO. + +FORCE_LOCAL_INCLUDES = NO + +# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the +# documentation for inline members. +# The default value is: YES. + +INLINE_INFO = YES + +# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the +# (detailed) documentation of file and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. +# The default value is: YES. + +SORT_MEMBER_DOCS = YES + +# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief +# descriptions of file, namespace and class members alphabetically by member +# name. If set to NO, the members will appear in declaration order. Note that +# this will also influence the order of the classes in the class list. +# The default value is: NO. + +SORT_BRIEF_DOCS = NO + +# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the +# (brief and detailed) documentation of class members so that constructors and +# destructors are listed first. If set to NO the constructors will appear in the +# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS. +# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief +# member documentation. +# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting +# detailed member documentation. +# The default value is: NO. + +SORT_MEMBERS_CTORS_1ST = NO + +# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy +# of group names into alphabetical order. If set to NO the group names will +# appear in their defined order. +# The default value is: NO. + +SORT_GROUP_NAMES = NO + +# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by +# fully-qualified names, including namespaces. If set to NO, the class list will +# be sorted only by class name, not including the namespace part. +# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. +# Note: This option applies only to the class list, not to the alphabetical +# list. +# The default value is: NO. + +SORT_BY_SCOPE_NAME = NO + +# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper +# type resolution of all parameters of a function it will reject a match between +# the prototype and the implementation of a member function even if there is +# only one candidate or it is obvious which candidate to choose by doing a +# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still +# accept a match between prototype and implementation in such cases. +# The default value is: NO. + +STRICT_PROTO_MATCHING = NO + +# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo +# list. This list is created by putting \todo commands in the documentation. +# The default value is: YES. + +GENERATE_TODOLIST = YES + +# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test +# list. This list is created by putting \test commands in the documentation. +# The default value is: YES. + +GENERATE_TESTLIST = YES + +# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug +# list. This list is created by putting \bug commands in the documentation. +# The default value is: YES. + +GENERATE_BUGLIST = YES + +# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO) +# the deprecated list. This list is created by putting \deprecated commands in +# the documentation. +# The default value is: YES. + +GENERATE_DEPRECATEDLIST= YES + +# The ENABLED_SECTIONS tag can be used to enable conditional documentation +# sections, marked by \if ... \endif and \cond +# ... \endcond blocks. + +ENABLED_SECTIONS = + +# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the +# initial value of a variable or macro / define can have for it to appear in the +# documentation. If the initializer consists of more lines than specified here +# it will be hidden. Use a value of 0 to hide initializers completely. The +# appearance of the value of individual variables and macros / defines can be +# controlled using \showinitializer or \hideinitializer command in the +# documentation regardless of this setting. +# Minimum value: 0, maximum value: 10000, default value: 30. + +MAX_INITIALIZER_LINES = 30 + +# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at +# the bottom of the documentation of classes and structs. If set to YES, the +# list will mention the files that were used to generate the documentation. +# The default value is: YES. + +SHOW_USED_FILES = YES + +# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This +# will remove the Files entry from the Quick Index and from the Folder Tree View +# (if specified). +# The default value is: YES. + +SHOW_FILES = YES + +# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces +# page. This will remove the Namespaces entry from the Quick Index and from the +# Folder Tree View (if specified). +# The default value is: YES. + +SHOW_NAMESPACES = YES + +# The FILE_VERSION_FILTER tag can be used to specify a program or script that +# doxygen should invoke to get the current version for each file (typically from +# the version control system). Doxygen will invoke the program by executing (via +# popen()) the command command input-file, where command is the value of the +# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided +# by doxygen. Whatever the program writes to standard output is used as the file +# version. For an example see the documentation. + +FILE_VERSION_FILTER = + +# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed +# by doxygen. The layout file controls the global structure of the generated +# output files in an output format independent way. To create the layout file +# that represents doxygen's defaults, run doxygen with the -l option. You can +# optionally specify a file name after the option, if omitted DoxygenLayout.xml +# will be used as the name of the layout file. +# +# Note that if you run doxygen from a directory containing a file called +# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE +# tag is left empty. + +LAYOUT_FILE = + +# The CITE_BIB_FILES tag can be used to specify one or more bib files containing +# the reference definitions. This must be a list of .bib files. The .bib +# extension is automatically appended if omitted. This requires the bibtex tool +# to be installed. See also https://en.wikipedia.org/wiki/BibTeX for more info. +# For LaTeX the style of the bibliography can be controlled using +# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the +# search path. See also \cite for info how to create references. + +CITE_BIB_FILES = + +#--------------------------------------------------------------------------- +# Configuration options related to warning and progress messages +#--------------------------------------------------------------------------- + +# The QUIET tag can be used to turn on/off the messages that are generated to +# standard output by doxygen. If QUIET is set to YES this implies that the +# messages are off. +# The default value is: NO. + +QUIET = NO + +# The WARNINGS tag can be used to turn on/off the warning messages that are +# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES +# this implies that the warnings are on. +# +# Tip: Turn warnings on while writing the documentation. +# The default value is: YES. + +WARNINGS = YES + +# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate +# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag +# will automatically be disabled. +# The default value is: YES. + +WARN_IF_UNDOCUMENTED = YES + +# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for +# potential errors in the documentation, such as not documenting some parameters +# in a documented function, or documenting parameters that don't exist or using +# markup commands wrongly. +# The default value is: YES. + +WARN_IF_DOC_ERROR = YES + +# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that +# are documented, but have no documentation for their parameters or return +# value. If set to NO, doxygen will only warn about wrong or incomplete +# parameter documentation, but not about the absence of documentation. +# The default value is: NO. + +WARN_NO_PARAMDOC = NO + +# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when +# a warning is encountered. +# The default value is: NO. + +WARN_AS_ERROR = NO + +# The WARN_FORMAT tag determines the format of the warning messages that doxygen +# can produce. The string should contain the $file, $line, and $text tags, which +# will be replaced by the file and line number from which the warning originated +# and the warning text. Optionally the format may contain $version, which will +# be replaced by the version of the file (if it could be obtained via +# FILE_VERSION_FILTER) +# The default value is: $file:$line: $text. + +WARN_FORMAT = "$file:$line: $text" + +# The WARN_LOGFILE tag can be used to specify a file to which warning and error +# messages should be written. If left blank the output is written to standard +# error (stderr). + +WARN_LOGFILE = + +#--------------------------------------------------------------------------- +# Configuration options related to the input files +#--------------------------------------------------------------------------- + +# The INPUT tag is used to specify the files and/or directories that contain +# documented source files. You may enter file names like myfile.cpp or +# directories like /usr/src/myproject. Separate the files or directories with +# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING +# Note: If this tag is empty the current directory is searched. + +INPUT = "C:\Users\Zelin Tong\Desktop\Spring 2018\Comp585\Game\Planet Casson" + +# This tag can be used to specify the character encoding of the source files +# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses +# libiconv (or the iconv built into libc) for the transcoding. See the libiconv +# documentation (see: https://www.gnu.org/software/libiconv/) for the list of +# possible encodings. +# The default value is: UTF-8. + +INPUT_ENCODING = UTF-8 + +# If the value of the INPUT tag contains directories, you can use the +# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and +# *.h) to filter out the source-files in the directories. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# read by doxygen. +# +# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp, +# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, +# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, +# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, +# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf. + +FILE_PATTERNS = *.c \ + *.cc \ + *.cxx \ + *.cpp \ + *.c++ \ + *.java \ + *.ii \ + *.ixx \ + *.ipp \ + *.i++ \ + *.inl \ + *.idl \ + *.ddl \ + *.odl \ + *.h \ + *.hh \ + *.hxx \ + *.hpp \ + *.h++ \ + *.cs \ + *.d \ + *.php \ + *.php4 \ + *.php5 \ + *.phtml \ + *.inc \ + *.m \ + *.markdown \ + *.md \ + *.mm \ + *.dox \ + *.py \ + *.pyw \ + *.f90 \ + *.f95 \ + *.f03 \ + *.f08 \ + *.f \ + *.for \ + *.tcl \ + *.vhd \ + *.vhdl \ + *.ucf \ + *.qsf + +# The RECURSIVE tag can be used to specify whether or not subdirectories should +# be searched for input files as well. +# The default value is: NO. + +RECURSIVE = YES + +# The EXCLUDE tag can be used to specify files and/or directories that should be +# excluded from the INPUT source files. This way you can easily exclude a +# subdirectory from a directory tree whose root is specified with the INPUT tag. +# +# Note that relative paths are relative to the directory from which doxygen is +# run. + +EXCLUDE = + +# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or +# directories that are symbolic links (a Unix file system feature) are excluded +# from the input. +# The default value is: NO. + +EXCLUDE_SYMLINKS = NO + +# If the value of the INPUT tag contains directories, you can use the +# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude +# certain files from those directories. +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories for example use the pattern */test/* + +EXCLUDE_PATTERNS = + +# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names +# (namespaces, classes, functions, etc.) that should be excluded from the +# output. The symbol name can be a fully qualified name, a word, or if the +# wildcard * is used, a substring. Examples: ANamespace, AClass, +# AClass::ANamespace, ANamespace::*Test +# +# Note that the wildcards are matched against the file with absolute path, so to +# exclude all test directories use the pattern */test/* + +EXCLUDE_SYMBOLS = + +# The EXAMPLE_PATH tag can be used to specify one or more files or directories +# that contain example code fragments that are included (see the \include +# command). + +EXAMPLE_PATH = + +# If the value of the EXAMPLE_PATH tag contains directories, you can use the +# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and +# *.h) to filter out the source-files in the directories. If left blank all +# files are included. + +EXAMPLE_PATTERNS = * + +# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be +# searched for input files to be used with the \include or \dontinclude commands +# irrespective of the value of the RECURSIVE tag. +# The default value is: NO. + +EXAMPLE_RECURSIVE = NO + +# The IMAGE_PATH tag can be used to specify one or more files or directories +# that contain images that are to be included in the documentation (see the +# \image command). + +IMAGE_PATH = "C:\Users\Zelin Tong\Desktop\Spring 2018\Comp585\Game\Docs Diagrams" + +# The INPUT_FILTER tag can be used to specify a program that doxygen should +# invoke to filter for each input file. Doxygen will invoke the filter program +# by executing (via popen()) the command: +# +# +# +# where is the value of the INPUT_FILTER tag, and is the +# name of an input file. Doxygen will then use the output that the filter +# program writes to standard output. If FILTER_PATTERNS is specified, this tag +# will be ignored. +# +# Note that the filter must not add or remove lines; it is applied before the +# code is scanned, but not when the output code is generated. If lines are added +# or removed, the anchors will not be placed correctly. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# properly processed by doxygen. + +INPUT_FILTER = + +# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern +# basis. Doxygen will compare the file name with each pattern and apply the +# filter if there is a match. The filters are a list of the form: pattern=filter +# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how +# filters are used. If the FILTER_PATTERNS tag is empty or if none of the +# patterns match the file name, INPUT_FILTER is applied. +# +# Note that for custom extensions or not directly supported extensions you also +# need to set EXTENSION_MAPPING for the extension otherwise the files are not +# properly processed by doxygen. + +FILTER_PATTERNS = + +# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using +# INPUT_FILTER) will also be used to filter the input files that are used for +# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES). +# The default value is: NO. + +FILTER_SOURCE_FILES = NO + +# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file +# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and +# it is also possible to disable source filtering for a specific pattern using +# *.ext= (so without naming a filter). +# This tag requires that the tag FILTER_SOURCE_FILES is set to YES. + +FILTER_SOURCE_PATTERNS = + +# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that +# is part of the input, its contents will be placed on the main page +# (index.html). This can be useful if you have a project on for instance GitHub +# and want to reuse the introduction page also for the doxygen output. + +USE_MDFILE_AS_MAINPAGE = + +#--------------------------------------------------------------------------- +# Configuration options related to source browsing +#--------------------------------------------------------------------------- + +# If the SOURCE_BROWSER tag is set to YES then a list of source files will be +# generated. Documented entities will be cross-referenced with these sources. +# +# Note: To get rid of all source code in the generated output, make sure that +# also VERBATIM_HEADERS is set to NO. +# The default value is: NO. + +SOURCE_BROWSER = YES + +# Setting the INLINE_SOURCES tag to YES will include the body of functions, +# classes and enums directly into the documentation. +# The default value is: NO. + +INLINE_SOURCES = NO + +# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any +# special comment blocks from generated source code fragments. Normal C, C++ and +# Fortran comments will always remain visible. +# The default value is: YES. + +STRIP_CODE_COMMENTS = YES + +# If the REFERENCED_BY_RELATION tag is set to YES then for each documented +# function all documented functions referencing it will be listed. +# The default value is: NO. + +REFERENCED_BY_RELATION = NO + +# If the REFERENCES_RELATION tag is set to YES then for each documented function +# all documented entities called/used by that function will be listed. +# The default value is: NO. + +REFERENCES_RELATION = NO + +# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set +# to YES then the hyperlinks from functions in REFERENCES_RELATION and +# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will +# link to the documentation. +# The default value is: YES. + +REFERENCES_LINK_SOURCE = YES + +# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the +# source code will show a tooltip with additional information such as prototype, +# brief description and links to the definition and documentation. Since this +# will make the HTML file larger and loading of large files a bit slower, you +# can opt to disable this feature. +# The default value is: YES. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +SOURCE_TOOLTIPS = YES + +# If the USE_HTAGS tag is set to YES then the references to source code will +# point to the HTML generated by the htags(1) tool instead of doxygen built-in +# source browser. The htags tool is part of GNU's global source tagging system +# (see https://www.gnu.org/software/global/global.html). You will need version +# 4.8.6 or higher. +# +# To use it do the following: +# - Install the latest version of global +# - Enable SOURCE_BROWSER and USE_HTAGS in the config file +# - Make sure the INPUT points to the root of the source tree +# - Run doxygen as normal +# +# Doxygen will invoke htags (and that will in turn invoke gtags), so these +# tools must be available from the command line (i.e. in the search path). +# +# The result: instead of the source browser generated by doxygen, the links to +# source code will now point to the output of htags. +# The default value is: NO. +# This tag requires that the tag SOURCE_BROWSER is set to YES. + +USE_HTAGS = NO + +# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a +# verbatim copy of the header file for each class for which an include is +# specified. Set to NO to disable this. +# See also: Section \class. +# The default value is: YES. + +VERBATIM_HEADERS = YES + +# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the +# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the +# cost of reduced performance. This can be particularly helpful with template +# rich C++ code for which doxygen's built-in parser lacks the necessary type +# information. +# Note: The availability of this option depends on whether or not doxygen was +# generated with the -Duse-libclang=ON option for CMake. +# The default value is: NO. + +CLANG_ASSISTED_PARSING = NO + +# If clang assisted parsing is enabled you can provide the compiler with command +# line options that you would normally use when invoking the compiler. Note that +# the include paths will already be set by doxygen for the files and directories +# specified with INPUT and INCLUDE_PATH. +# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES. + +CLANG_OPTIONS = + +# If clang assisted parsing is enabled you can provide the clang parser with the +# path to the compilation database (see: +# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) used when the files +# were built. This is equivalent to specifying the "-p" option to a clang tool, +# such as clang-check. These options will then be pased to the parser. +# Note: The availability of this option depends on whether or not doxygen was +# generated with the -Duse-libclang=ON option for CMake. +# The default value is: 0. + +CLANG_COMPILATION_DATABASE_PATH= 0 + +#--------------------------------------------------------------------------- +# Configuration options related to the alphabetical class index +#--------------------------------------------------------------------------- + +# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all +# compounds will be generated. Enable this if the project contains a lot of +# classes, structs, unions or interfaces. +# The default value is: YES. + +ALPHABETICAL_INDEX = YES + +# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in +# which the alphabetical index list will be split. +# Minimum value: 1, maximum value: 20, default value: 5. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +COLS_IN_ALPHA_INDEX = 5 + +# In case all classes in a project start with a common prefix, all classes will +# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag +# can be used to specify a prefix (or a list of prefixes) that should be ignored +# while generating the index headers. +# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. + +IGNORE_PREFIX = + +#--------------------------------------------------------------------------- +# Configuration options related to the HTML output +#--------------------------------------------------------------------------- + +# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output +# The default value is: YES. + +GENERATE_HTML = YES + +# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a +# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of +# it. +# The default directory is: html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_OUTPUT = html + +# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each +# generated HTML page (for example: .htm, .php, .asp). +# The default value is: .html. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FILE_EXTENSION = .html + +# The HTML_HEADER tag can be used to specify a user-defined HTML header file for +# each generated HTML page. If the tag is left blank doxygen will generate a +# standard header. +# +# To get valid HTML the header file that includes any scripts and style sheets +# that doxygen needs, which is dependent on the configuration options used (e.g. +# the setting GENERATE_TREEVIEW). It is highly recommended to start with a +# default header using +# doxygen -w html new_header.html new_footer.html new_stylesheet.css +# YourConfigFile +# and then modify the file new_header.html. See also section "Doxygen usage" +# for information on how to generate the default header that doxygen normally +# uses. +# Note: The header is subject to change so you typically have to regenerate the +# default header when upgrading to a newer version of doxygen. For a description +# of the possible markers and block names see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_HEADER = + +# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each +# generated HTML page. If the tag is left blank doxygen will generate a standard +# footer. See HTML_HEADER for more information on how to generate a default +# footer and what special commands can be used inside the footer. See also +# section "Doxygen usage" for information on how to generate the default footer +# that doxygen normally uses. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FOOTER = + +# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style +# sheet that is used by each HTML page. It can be used to fine-tune the look of +# the HTML output. If left blank doxygen will generate a default style sheet. +# See also section "Doxygen usage" for information on how to generate the style +# sheet that doxygen normally uses. +# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as +# it is more robust and this tag (HTML_STYLESHEET) will in the future become +# obsolete. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_STYLESHEET = + +# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined +# cascading style sheets that are included after the standard style sheets +# created by doxygen. Using this option one can overrule certain style aspects. +# This is preferred over using HTML_STYLESHEET since it does not replace the +# standard style sheet and is therefore more robust against future updates. +# Doxygen will copy the style sheet files to the output directory. +# Note: The order of the extra style sheet files is of importance (e.g. the last +# style sheet in the list overrules the setting of the previous ones in the +# list). For an example see the documentation. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_STYLESHEET = + +# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or +# other source files which should be copied to the HTML output directory. Note +# that these files will be copied to the base HTML output directory. Use the +# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these +# files. In the HTML_STYLESHEET file, use the file name only. Also note that the +# files will be copied as-is; there are no commands or markers available. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_EXTRA_FILES = + +# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen +# will adjust the colors in the style sheet and background images according to +# this color. Hue is specified as an angle on a colorwheel, see +# https://en.wikipedia.org/wiki/Hue for more information. For instance the value +# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300 +# purple, and 360 is red again. +# Minimum value: 0, maximum value: 359, default value: 220. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_HUE = 220 + +# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors +# in the HTML output. For a value of 0 the output will use grayscales only. A +# value of 255 will produce the most vivid colors. +# Minimum value: 0, maximum value: 255, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_SAT = 100 + +# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the +# luminance component of the colors in the HTML output. Values below 100 +# gradually make the output lighter, whereas values above 100 make the output +# darker. The value divided by 100 is the actual gamma applied, so 80 represents +# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not +# change the gamma. +# Minimum value: 40, maximum value: 240, default value: 80. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_COLORSTYLE_GAMMA = 80 + +# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML +# page will contain the date and time when the page was generated. Setting this +# to YES can help to show when doxygen was last run and thus if the +# documentation is up to date. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_TIMESTAMP = NO + +# If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML +# documentation will contain a main index with vertical navigation menus that +# are dynamically created via Javascript. If disabled, the navigation index will +# consists of multiple levels of tabs that are statically embedded in every HTML +# page. Disable this option to support browsers that do not have Javascript, +# like the Qt help browser. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_DYNAMIC_MENUS = YES + +# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML +# documentation will contain sections that can be hidden and shown after the +# page has loaded. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_DYNAMIC_SECTIONS = NO + +# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries +# shown in the various tree structured indices initially; the user can expand +# and collapse entries dynamically later on. Doxygen will expand the tree to +# such a level that at most the specified number of entries are visible (unless +# a fully collapsed tree already exceeds this amount). So setting the number of +# entries 1 will produce a full collapsed tree by default. 0 is a special value +# representing an infinite number of entries and will result in a full expanded +# tree by default. +# Minimum value: 0, maximum value: 9999, default value: 100. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_INDEX_NUM_ENTRIES = 100 + +# If the GENERATE_DOCSET tag is set to YES, additional index files will be +# generated that can be used as input for Apple's Xcode 3 integrated development +# environment (see: https://developer.apple.com/tools/xcode/), introduced with +# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a +# Makefile in the HTML output directory. Running make will produce the docset in +# that directory and running make install will install the docset in +# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at +# startup. See https://developer.apple.com/tools/creatingdocsetswithdoxygen.html +# for more information. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_DOCSET = NO + +# This tag determines the name of the docset feed. A documentation feed provides +# an umbrella under which multiple documentation sets from a single provider +# (such as a company or product suite) can be grouped. +# The default value is: Doxygen generated docs. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_FEEDNAME = "Doxygen generated docs" + +# This tag specifies a string that should uniquely identify the documentation +# set bundle. This should be a reverse domain-name style string, e.g. +# com.mycompany.MyDocSet. Doxygen will append .docset to the name. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_BUNDLE_ID = org.doxygen.Project + +# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify +# the documentation publisher. This should be a reverse domain-name style +# string, e.g. com.mycompany.MyDocSet.documentation. +# The default value is: org.doxygen.Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_ID = org.doxygen.Publisher + +# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher. +# The default value is: Publisher. +# This tag requires that the tag GENERATE_DOCSET is set to YES. + +DOCSET_PUBLISHER_NAME = Publisher + +# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three +# additional HTML index files: index.hhp, index.hhc, and index.hhk. The +# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop +# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on +# Windows. +# +# The HTML Help Workshop contains a compiler that can convert all HTML output +# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML +# files are now used as the Windows 98 help format, and will replace the old +# Windows help format (.hlp) on all Windows platforms in the future. Compressed +# HTML files also contain an index, a table of contents, and you can search for +# words in the documentation. The HTML workshop also contains a viewer for +# compressed HTML files. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_HTMLHELP = NO + +# The CHM_FILE tag can be used to specify the file name of the resulting .chm +# file. You can add a path in front of the file if the result should not be +# written to the html output directory. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_FILE = + +# The HHC_LOCATION tag can be used to specify the location (absolute path +# including file name) of the HTML help compiler (hhc.exe). If non-empty, +# doxygen will try to run the HTML help compiler on the generated index.hhp. +# The file has to be specified with full path. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +HHC_LOCATION = + +# The GENERATE_CHI flag controls if a separate .chi index file is generated +# (YES) or that it should be included in the master .chm file (NO). +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +GENERATE_CHI = NO + +# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc) +# and project file content. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +CHM_INDEX_ENCODING = + +# The BINARY_TOC flag controls whether a binary table of contents is generated +# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it +# enables the Previous and Next buttons. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +BINARY_TOC = NO + +# The TOC_EXPAND flag can be set to YES to add extra items for group members to +# the table of contents of the HTML help documentation and to the tree view. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTMLHELP is set to YES. + +TOC_EXPAND = NO + +# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and +# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that +# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help +# (.qch) of the generated HTML documentation. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_QHP = NO + +# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify +# the file name of the resulting .qch file. The path specified is relative to +# the HTML output folder. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QCH_FILE = + +# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help +# Project output. For more information please see Qt Help Project / Namespace +# (see: http://doc.qt.io/qt-4.8/qthelpproject.html#namespace). +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_NAMESPACE = org.doxygen.Project + +# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt +# Help Project output. For more information please see Qt Help Project / Virtual +# Folders (see: http://doc.qt.io/qt-4.8/qthelpproject.html#virtual-folders). +# The default value is: doc. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_VIRTUAL_FOLDER = doc + +# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom +# filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://doc.qt.io/qt-4.8/qthelpproject.html#custom-filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_NAME = + +# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the +# custom filter to add. For more information please see Qt Help Project / Custom +# Filters (see: http://doc.qt.io/qt-4.8/qthelpproject.html#custom-filters). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_CUST_FILTER_ATTRS = + +# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this +# project's filter section matches. Qt Help Project / Filter Attributes (see: +# http://doc.qt.io/qt-4.8/qthelpproject.html#filter-attributes). +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHP_SECT_FILTER_ATTRS = + +# The QHG_LOCATION tag can be used to specify the location of Qt's +# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the +# generated .qhp file. +# This tag requires that the tag GENERATE_QHP is set to YES. + +QHG_LOCATION = + +# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be +# generated, together with the HTML files, they form an Eclipse help plugin. To +# install this plugin and make it available under the help contents menu in +# Eclipse, the contents of the directory containing the HTML and XML files needs +# to be copied into the plugins directory of eclipse. The name of the directory +# within the plugins directory should be the same as the ECLIPSE_DOC_ID value. +# After copying Eclipse needs to be restarted before the help appears. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_ECLIPSEHELP = NO + +# A unique identifier for the Eclipse help plugin. When installing the plugin +# the directory name containing the HTML and XML files should also have this +# name. Each documentation set should have its own identifier. +# The default value is: org.doxygen.Project. +# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES. + +ECLIPSE_DOC_ID = org.doxygen.Project + +# If you want full control over the layout of the generated HTML pages it might +# be necessary to disable the index and replace it with your own. The +# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top +# of each HTML page. A value of NO enables the index and the value YES disables +# it. Since the tabs in the index contain the same information as the navigation +# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +DISABLE_INDEX = NO + +# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index +# structure should be generated to display hierarchical information. If the tag +# value is set to YES, a side panel will be generated containing a tree-like +# index structure (just like the one that is generated for HTML Help). For this +# to work a browser that supports JavaScript, DHTML, CSS and frames is required +# (i.e. any modern browser). Windows users are probably better off using the +# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can +# further fine-tune the look of the index. As an example, the default style +# sheet generated by doxygen has an example that shows how to put an image at +# the root of the tree instead of the PROJECT_NAME. Since the tree basically has +# the same information as the tab index, you could consider setting +# DISABLE_INDEX to YES when enabling this option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +GENERATE_TREEVIEW = NO + +# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that +# doxygen will group on one line in the generated HTML documentation. +# +# Note that a value of 0 will completely suppress the enum values from appearing +# in the overview section. +# Minimum value: 0, maximum value: 20, default value: 4. +# This tag requires that the tag GENERATE_HTML is set to YES. + +ENUM_VALUES_PER_LINE = 4 + +# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used +# to set the initial width (in pixels) of the frame in which the tree is shown. +# Minimum value: 0, maximum value: 1500, default value: 250. +# This tag requires that the tag GENERATE_HTML is set to YES. + +TREEVIEW_WIDTH = 250 + +# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to +# external symbols imported via tag files in a separate window. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +EXT_LINKS_IN_WINDOW = NO + +# Use this tag to change the font size of LaTeX formulas included as images in +# the HTML documentation. When you change the font size after a successful +# doxygen run you need to manually remove any form_*.png images from the HTML +# output directory to force them to be regenerated. +# Minimum value: 8, maximum value: 50, default value: 10. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_FONTSIZE = 10 + +# Use the FORMULA_TRANSPARENT tag to determine whether or not the images +# generated for formulas are transparent PNGs. Transparent PNGs are not +# supported properly for IE 6.0, but are supported on all modern browsers. +# +# Note that when changing this option you need to delete any form_*.png files in +# the HTML output directory before the changes have effect. +# The default value is: YES. +# This tag requires that the tag GENERATE_HTML is set to YES. + +FORMULA_TRANSPARENT = YES + +# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see +# https://www.mathjax.org) which uses client side Javascript for the rendering +# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX +# installed or if you want to formulas look prettier in the HTML output. When +# enabled you may also need to install MathJax separately and configure the path +# to it using the MATHJAX_RELPATH option. +# The default value is: NO. +# This tag requires that the tag GENERATE_HTML is set to YES. + +USE_MATHJAX = NO + +# When MathJax is enabled you can set the default output format to be used for +# the MathJax output. See the MathJax site (see: +# http://docs.mathjax.org/en/latest/output.html) for more details. +# Possible values are: HTML-CSS (which is slower, but has the best +# compatibility), NativeMML (i.e. MathML) and SVG. +# The default value is: HTML-CSS. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_FORMAT = HTML-CSS + +# When MathJax is enabled you need to specify the location relative to the HTML +# output directory using the MATHJAX_RELPATH option. The destination directory +# should contain the MathJax.js script. For instance, if the mathjax directory +# is located at the same level as the HTML output directory, then +# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax +# Content Delivery Network so you can quickly see the result without installing +# MathJax. However, it is strongly recommended to install a local copy of +# MathJax from https://www.mathjax.org before deployment. +# The default value is: http://cdn.mathjax.org/mathjax/latest. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest + +# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax +# extension names that should be enabled during MathJax rendering. For example +# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_EXTENSIONS = + +# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces +# of code that will be used on startup of the MathJax code. See the MathJax site +# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an +# example see the documentation. +# This tag requires that the tag USE_MATHJAX is set to YES. + +MATHJAX_CODEFILE = + +# When the SEARCHENGINE tag is enabled doxygen will generate a search box for +# the HTML output. The underlying search engine uses javascript and DHTML and +# should work on any modern browser. Note that when using HTML help +# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET) +# there is already a search function so this one should typically be disabled. +# For large projects the javascript based search engine can be slow, then +# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to +# search using the keyboard; to jump to the search box use + S +# (what the is depends on the OS and browser, but it is typically +# , /