68ff8f6921
Major change is addition of fractal rift rendering, currently first pass. Curves are registered and pregenerated in mod_pocketDim. Rifts look up these curves, choose one, rotate it, and render it. The render is a TESR that does stuff. Hard to explain, look at RenderRift in the code and look at the actual rifts in game to get an idea of what it does. I had to add a triangulation library to accomplish this. Will hopefully do something else that drag around all this. (I tried(and used comments))
113 lines
3.5 KiB
Java
113 lines
3.5 KiB
Java
/* Poly2Tri
|
|
* Copyright (c) 2009-2010, Poly2Tri Contributors
|
|
* http://code.google.com/p/poly2tri/
|
|
*
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without modification,
|
|
* are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright notice,
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
* and/or other materials provided with the distribution.
|
|
* * Neither the name of Poly2Tri nor the names of its contributors may be
|
|
* used to endorse or promote products derived from this software without specific
|
|
* prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
package org.poly2tri.triangulation;
|
|
|
|
import java.util.ArrayList;
|
|
|
|
import org.poly2tri.geometry.primitives.Point;
|
|
import org.poly2tri.triangulation.delaunay.sweep.DTSweepConstraint;
|
|
|
|
|
|
public abstract class TriangulationPoint extends Point
|
|
{
|
|
// List of edges this point constitutes an upper ending point (CDT)
|
|
private ArrayList<DTSweepConstraint> edges;
|
|
|
|
@Override
|
|
public String toString()
|
|
{
|
|
return "[" + getX() + "," + getY() + "]";
|
|
}
|
|
|
|
public abstract double getX();
|
|
public abstract double getY();
|
|
public abstract double getZ();
|
|
|
|
public abstract float getXf();
|
|
public abstract float getYf();
|
|
public abstract float getZf();
|
|
|
|
public abstract void set( double x, double y, double z );
|
|
|
|
public ArrayList<DTSweepConstraint> getEdges()
|
|
{
|
|
return edges;
|
|
}
|
|
|
|
public void addEdge( DTSweepConstraint e )
|
|
{
|
|
if( edges == null )
|
|
{
|
|
edges = new ArrayList<DTSweepConstraint>();
|
|
}
|
|
edges.add( e );
|
|
}
|
|
|
|
public boolean hasEdges()
|
|
{
|
|
return edges != null;
|
|
}
|
|
|
|
/**
|
|
* @param p - edge destination point
|
|
* @return the edge from this point to given point
|
|
*/
|
|
public DTSweepConstraint getEdge( TriangulationPoint p )
|
|
{
|
|
for( DTSweepConstraint c : edges )
|
|
{
|
|
if( c.p == p )
|
|
{
|
|
return c;
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
public boolean equals(Object obj)
|
|
{
|
|
if( obj instanceof TriangulationPoint )
|
|
{
|
|
TriangulationPoint p = (TriangulationPoint)obj;
|
|
return getX() == p.getX() && getY() == p.getY();
|
|
}
|
|
return super.equals( obj );
|
|
}
|
|
|
|
public int hashCode()
|
|
{
|
|
long bits = java.lang.Double.doubleToLongBits(getX());
|
|
bits ^= java.lang.Double.doubleToLongBits(getY()) * 31;
|
|
return (((int) bits) ^ ((int) (bits >> 32)));
|
|
}
|
|
|
|
}
|