Changeset 10008

Timestamp:

09/26/13 23:56:55 (11 years ago)

Author:

ascheibe

Message:

#1886 added volume calculation for convex d-polytopes

File:

• branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior.Analyzers/3.3/ConvexHullMeasures.cs (modified) (2 diffs)

branches/HeuristicLab.Analysis.AlgorithmBehavior/HeuristicLab.Analysis.AlgorithmBehavior.Analyzers/3.3/ConvexHullMeasures.cs

@@ -25 +25 @@
 namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
   public static class ConvexHullMeasures {
-    //TODO: Calculates only the volumne of a d-simplex
-    public static double CalculateVolume(List<double[]> hyperHull) {
+    //Calculates the volumne of a d-simplex
+    private static double CalculateSimplexVolume(List<double[]> hyperHull) {
       double[,] diffs = new double[hyperHull.Count, hyperHull.Count];
 
@@ -50 +50 @@
       return result;
     }
+
+    //calculate inner point for boundary triangulation (slowwwww.....)
+    private static double[] CalculateInnerPoint(List<double[]> hyperHull) {
+      double[] result = new double[hyperHull[0].Count()];
+
+      for (int i = 0; i < hyperHull[0].Count(); i++) {
+        result[i] = hyperHull.Max(x => x[i]) - hyperHull.Min(x => x[i]);
+      }
+
+      return result;
+    }
+
+    //calculates the volume of a convex d-polytope
+    //decomposition based on boundary triangulation
+    public static double CalculateVolume(List<double[]> hyperHull) {
+      double[] innerPoint = CalculateInnerPoint(hyperHull);
+      double volume = 0.0;
+
+      for (int i = 0; i < hyperHull.Count - 1; i += 2) {
+        List<double[]> simplex = new List<double[]>();
+        simplex.Add(innerPoint);
+        simplex.Add(hyperHull[i]);
+        simplex.Add(hyperHull[i + 1]);
+        volume += CalculateSimplexVolume(simplex);
+      }
+      return volume;
+    }
   }
 }