So I just finished up a way to solve Standard Form Quadratic Equations, Now I want to code a way to automatically Convert a given Standard Form equation to Vertex Form, or Vertex to Standard. Is it possible due to the fact that you have to get a perfect square binomial? Could you just use the Square Root of h in y = a(x-h)^2+k? I've searched google and elsewhere with no luck finding code for a converter. So I came here for a start. package com.github.geodox.quadraticconverter; import java.util.Scanner; public class QuadraticConverter { public static void main(String[] args) { Scanner s … |
+0 forum
9 | ||

Hiya! I have a function that creates 3D meshes procedurally from the given parameters. It creates a four-sided box, which is (for example) 1.0 wide, 1.0 high and 100.0 long. The box is then subdivided into multiple parts, so if the aforementioned box is subdivided to three parts, it will have vertices at 0f, 33.3f, 66.7f and 100.0f on the longest sides. Now, I have the vertex generation code up and running, but I have a problem generating the triangle lists from the vertices. The box does only contain the sides, not the caps. ![triangulation](/attachments/small/3/triangulation.jpg "align-left") The picture here shows … |
+0 forum
5 |

The End.