toxiclibs 0.4.0 → 0.8.0

data/src/toxi/geom/mesh/subdiv/DualSubdivision.java

@@ -0,0 +1,49 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import toxi.geom.Vec3D;
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * This subdivision strategy splits an edge in three equal parts using two split
+ * points at 33% and 66% of the edge.
+ */
+public class DualSubdivision extends SubdivisionStrategy {
+
+    @Override
+    public List<Vec3D> computeSplitPoints(WingedEdge edge) {
+        List<Vec3D> mid = new ArrayList<>(2);
+        mid.add(edge.a.interpolateTo(edge.b, 0.3333f));
+        mid.add(edge.a.interpolateTo(edge.b, 0.6666f));
+        return mid;
+    }
+}

data/src/toxi/geom/mesh/subdiv/EdgeLengthComparator.java

@@ -0,0 +1,50 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.Comparator;
+
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * Comparator used by {@link SubdivisionStrategy#getEdgeOrdering()} to define
+ * the order of edges to be subdivided. This one prioritizes longer edges.
+ */
+public class EdgeLengthComparator implements Comparator<WingedEdge> {
+
+    /**
+     *
+     * @param e1
+     * @param e2
+     * @return
+     */
+    @Override
+    public int compare(WingedEdge e1, WingedEdge e2) {
+        return (int) (e2.getLengthSquared() - e1.getLengthSquared());
+    }
+}

data/src/toxi/geom/mesh/subdiv/FaceCountComparator.java

@@ -0,0 +1,51 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.Comparator;
+
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * Comparator used by {@link SubdivisionStrategy#getEdgeOrdering()} to define
+ * the order of edges to be subdivided. This one prioritizes edges with the most
+ * faces associated.
+ */
+public class FaceCountComparator implements Comparator<WingedEdge> {
+
+    /**
+     *
+     * @param e1
+     * @param e2
+     * @return
+     */
+    @Override
+    public int compare(WingedEdge e1, WingedEdge e2) {
+        return (e2.faces.size() - e1.faces.size());
+    }
+}

data/src/toxi/geom/mesh/subdiv/MidpointDisplacementSubdivision.java

@@ -0,0 +1,80 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import toxi.geom.Vec3D;
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * This subdivision strategy splits an edge in two equal halves at its mid
+ * point. The midpoint itself is being displaced, however, in the direction of
+ * the vector going from the configured reference point (often the mesh centroid
+ * is used) towards the edge midpoint. The displacement amount is configurable
+ * as fraction of the original edge length. So given that:
+ * 
+ * <pre>
+ * M = edge midpoint
+ * R = reference point
+ * l = edge length
+ * a = displacement amplification factor
+ * 
+ * D  = normalized(M-R)
+ * M' = M + D * a * l
+ * </pre>
+ */
+public class MidpointDisplacementSubdivision extends DisplacementSubdivision {
+
+    /**
+     *
+     */
+    public Vec3D centroid;
+
+    /**
+     *
+     * @param centroid
+     * @param amount
+     */
+    public MidpointDisplacementSubdivision(Vec3D centroid, float amount) {
+        super(amount);
+        this.centroid = centroid;
+    }
+
+    @Override
+    public List<Vec3D> computeSplitPoints(WingedEdge edge) {
+        Vec3D mid = edge.getMidPoint();
+        // Vec3D mid = edge.a.interpolateTo(edge.b, 0.25f);
+        Vec3D n = mid.sub(centroid).normalizeTo(amp * edge.getLength());
+        List<Vec3D> points = new ArrayList<>(1);
+        points.add(mid.addSelf(n));
+        return points;
+    }
+
+}

data/src/toxi/geom/mesh/subdiv/MidpointSubdiv.java

@@ -0,0 +1,42 @@
+package toxi.geom.mesh.subdiv;
+
+import java.util.List;
+
+import toxi.geom.Vec3D;
+
+/**
+ *
+ * @author tux
+ */
+public class MidpointSubdiv implements NewSubdivStrategy {
+
+    /**
+     *
+     * @param a
+     * @param b
+     * @param c
+     * @param resultVertices
+     * @return
+     */
+    @Override
+    public List<Vec3D[]> subdivideTriangle(Vec3D a, Vec3D b, Vec3D c,
+            List<Vec3D[]> resultVertices) {
+        Vec3D mab = a.interpolateTo(b, 0.5f);
+        Vec3D mbc = b.interpolateTo(c, 0.5f);
+        Vec3D mca = c.interpolateTo(a, 0.5f);
+        resultVertices.add(new Vec3D[] {
+                a, mab, mca
+        });
+        resultVertices.add(new Vec3D[] {
+                mab, b, mbc
+        });
+        resultVertices.add(new Vec3D[] {
+                mbc, c, mca
+        });
+        resultVertices.add(new Vec3D[] {
+                mab, mbc, mca
+        });
+        return resultVertices;
+    }
+
+}

data/src/toxi/geom/mesh/subdiv/MidpointSubdivision.java

@@ -0,0 +1,48 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import toxi.geom.Vec3D;
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * This subdivision strategy simply splits an edge in two equal halves.
+ */
+public class MidpointSubdivision extends SubdivisionStrategy {
+
+    @Override
+    public List<Vec3D> computeSplitPoints(WingedEdge edge) {
+        List<Vec3D> mid = new ArrayList<>(1);
+        mid.add(edge.getMidPoint());
+        return mid;
+    }
+
+}

data/src/toxi/geom/mesh/subdiv/NewSubdivStrategy.java

@@ -0,0 +1,23 @@
+package toxi.geom.mesh.subdiv;
+
+import java.util.List;
+
+import toxi.geom.Vec3D;
+
+/**
+ *
+ * @author tux
+ */
+public interface NewSubdivStrategy {
+
+    /**
+     *
+     * @param a
+     * @param b
+     * @param c
+     * @param resultVertices
+     * @return
+     */
+    public List<Vec3D[]> subdivideTriangle(Vec3D a, Vec3D b, Vec3D c,
+            List<Vec3D[]> resultVertices);
+}

data/src/toxi/geom/mesh/subdiv/NormalDisplacementSubdivision.java

@@ -0,0 +1,74 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import toxi.geom.Vec3D;
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * This subdivision strategy splits an edge in two equal halves at its mid
+ * point. The midpoint itself is being displaced, however, in the average
+ * direction of face normals associated with this edge. The displacement amount
+ * is configurable as fraction of the original edge length. So given that:
+ * 
+ * <pre>
+ * M = edge midpoint
+ * N = averaged normal vector
+ * l = edge length
+ * a = displacement amplification factor
+ * 
+ * M' = M + N * a * l
+ * </pre>
+ */
+public class NormalDisplacementSubdivision extends DisplacementSubdivision {
+
+    /**
+     *
+     * @param amp
+     */
+    public NormalDisplacementSubdivision(float amp) {
+        super(amp);
+    }
+
+    @Override
+    public List<Vec3D> computeSplitPoints(WingedEdge edge) {
+        Vec3D mid = edge.getMidPoint();
+        Vec3D n = edge.faces.get(0).normal;
+        if (edge.faces.size() > 1) {
+            n.addSelf(edge.faces.get(1).normal);
+        }
+        n.normalizeTo(amp * edge.getLength());
+        List<Vec3D> points = new ArrayList<>(3);
+        points.add(mid.addSelf(n));
+        return points;
+    }
+
+}

data/src/toxi/geom/mesh/subdiv/SubdivisionStrategy.java

@@ -0,0 +1,83 @@
+/*
+ *   __               .__       .__  ._____.           
+ * _/  |_  _______  __|__| ____ |  | |__\_ |__   ______
+ * \   __\/  _ \  \/  /  |/ ___\|  | |  || __ \ /  ___/
+ *  |  | (  <_> >    <|  \  \___|  |_|  || \_\ \\___ \ 
+ *  |__|  \____/__/\_ \__|\___  >____/__||___  /____  >
+ *                   \/       \/             \/     \/ 
+ *
+ * Copyright (c) 2006-2011 Karsten Schmidt
+ * 
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ * 
+ * http://creativecommons.org/licenses/LGPL/2.1/
+ * 
+ * This library is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * Lesser General Public License for more details.
+ * 
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
+ */
+
+package toxi.geom.mesh.subdiv;
+
+import java.util.Comparator;
+import java.util.List;
+
+import toxi.geom.Vec3D;
+import toxi.geom.mesh.WETriangleMesh;
+import toxi.geom.mesh.WingedEdge;
+
+/**
+ * This is the abstract parent class for all subdivision strategies. Each of its
+ * implementations defines a concrete solution to split a single edge of a
+ * {@link WETriangleMesh}.
+ */
+public abstract class SubdivisionStrategy {
+
+    /**
+     *
+     */
+    public static final Comparator<? super WingedEdge> DEFAULT_ORDERING = new EdgeLengthComparator();
+
+    /**
+     *
+     */
+    protected Comparator<? super WingedEdge> order = DEFAULT_ORDERING;
+
+    /**
+     * Computes a number of points on (or near) the given edge which are used
+     * for splitting the edge in smaller segments.
+     * 
+     * @param edge
+     *            edge to split
+     * @return list of split points
+     */
+    public abstract List<Vec3D> computeSplitPoints(WingedEdge edge);
+
+    /**
+     * Returns the {@link Comparator} used to sort a mesh's edge list based on a
+     * certain criteria. By default the {@link EdgeLengthComparator} is used.
+     * 
+     * @return edge comparator
+     */
+    public Comparator<? super WingedEdge> getEdgeOrdering() {
+        return order;
+    }
+
+    /**
+     * Sets the given edge list {@link Comparator} for a strategy
+     * implementation.
+     * 
+     * @param order
+     */
+    public void setEdgeOrdering(Comparator<? super WingedEdge> order) {
+        this.order = order;
+    }
+}