se.llbit.chunky.model.VineModel Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of chunky-core
Minecraft mapping and rendering tool
There is a newer version: 1.4.5
/* Copyright (c) 2012 Jesper Öqvist 
 *
 * This file is part of Chunky.
 *
 * Chunky is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Chunky 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 General Public License for more details.
 * You should have received a copy of the GNU General Public License
 * along with Chunky.  If not, see .
 */
package se.llbit.chunky.model;

import se.llbit.chunky.renderer.scene.Scene;
import se.llbit.chunky.resources.Texture;
import se.llbit.chunky.world.BlockData;
import se.llbit.math.DoubleSidedQuad;
import se.llbit.math.Quad;
import se.llbit.math.QuickMath;
import se.llbit.math.Ray;
import se.llbit.math.Vector3;
import se.llbit.math.Vector4;

public class VineModel {
  protected static Quad[] quads = {
      // south
      new DoubleSidedQuad(new Vector3(1, 0, 15 / 16.), new Vector3(0, 0, 15 / 16.),
          new Vector3(1, 1, 15 / 16.), new Vector4(1, 0, 0, 1)),

      // west
      new DoubleSidedQuad(new Vector3(1 / 16., 0, 1), new Vector3(1 / 16., 0, 0),
          new Vector3(1 / 16., 1, 1), new Vector4(1, 0, 0, 1)),

      // north
      new DoubleSidedQuad(new Vector3(0, 0, 1 / 16.), new Vector3(1, 0, 1 / 16.),
          new Vector3(0, 1, 1 / 16.), new Vector4(0, 1, 0, 1)),

      // east
      new DoubleSidedQuad(new Vector3(15 / 16., 0, 0), new Vector3(15 / 16., 0, 1),
          new Vector3(15 / 16., 1, 0), new Vector4(0, 1, 0, 1)),

      // top
      new Quad(new Vector3(0, 1, 0), new Vector3(1, 1, 0), new Vector3(0, 1, 1),
          new Vector4(0, 1, 0, 1)),

  };

  public static boolean intersect(Ray ray, Scene scene) {
    int data = ray.getBlockData();
    boolean hit = false;
    ray.t = Double.POSITIVE_INFINITY;
    for (int i = 0; i < quads.length; ++i) {
      if ((data & (1 << i)) != 0) {
        Quad quad = quads[i];
        if (quad.intersect(ray)) {
          float[] color = Texture.vines.getColor(ray.u, ray.v);
          if (color[3] > Ray.EPSILON) {
            ray.color.set(color);
            float[] biomeColor = ray.getBiomeFoliageColor(scene);
            ray.color.x *= biomeColor[0];
            ray.color.y *= biomeColor[1];
            ray.color.z *= biomeColor[2];
            ray.t = ray.tNext;
            ray.n.set(quad.n);
            ray.n.scale(QuickMath.signum(-ray.d.dot(quad.n)));
            hit = true;
          }
        }
      }
    }
    if (data == 0 || (ray.getCurrentData() & (1 << BlockData.VINE_TOP)) != 0) {
      Quad quad = quads[4];
      if (quad.intersect(ray)) {
        float[] color = Texture.vines.getColor(ray.u, ray.v);
        if (color[3] > Ray.EPSILON) {
          ray.color.set(color);
          float[] biomeColor = ray.getBiomeFoliageColor(scene);
          ray.color.x *= biomeColor[0];
          ray.color.y *= biomeColor[1];
          ray.color.z *= biomeColor[2];
          ray.t = ray.tNext;
          ray.n.set(quad.n);
          ray.n.scale(QuickMath.signum(-ray.d.dot(quad.n)));
          hit = true;
        }
      }
    }
    if (hit) {
      ray.distance += ray.t;
      ray.o.scaleAdd(ray.t, ray.d);
    }
    return hit;
  }
}