Welcome to the Java Programming Forums


The professional, friendly Java community. 21,500 members and growing!


The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.


>> REGISTER NOW TO START POSTING


Members have full access to the forums. Advertisements are removed for registered users.

View RSS Feed

helloworld922

  1. LWJGL 3D Terrain Update

    Updated post here. I'm starting to modernize my code by moving to a shader-based model.

    Made some changes to my code and pretty much everything is significantly better. My previous post: LWJGL 3D Terrain



    The aesthetics were greatly improved by switching from bilinear interpolation to a sine-based interpolation function. For more details on how I generated the height map see this page. ...

    Updated October 5th, 2012 at 03:25 AM by helloworld922

    Categories
    Uncategorized
  2. LWJGL 3D Terrain

    Updated post here (performance and quality significantly improved)

    A break from tradition, this time I'm not going to be posting some kind of a tutorial/tip. Rather, I'm going to post a few screen-shots of my current project, which involves 3D terrains.

    The terrain is randomly generated at the beginning of the test program using multiple 2D noise functions with increasing frequency and decreasing amplitude, and then bi-linearly interpolated together into a height map. ...

    Updated October 3rd, 2012 at 05:12 PM by helloworld922

    Categories
    Uncategorized
  3. Optimizing the Sieve of Eratosthenes

    The Sieve of Eratosthenes is one of the fastest methods for generating a list of prime numbers less than a given number n. A general description of the algorithm is given below:

    1. Initialize a list representing the numbers [2,n). This denotes whether a given number is prime or composite.
    2. Start from the beginning of the list. If the number is denoted as prime, save it. Otherwise, move on.
    3. For every multiple of the current prime, mark it as a composite number. ...

    Updated September 29th, 2012 at 07:26 PM by helloworld922

    Categories
    Uncategorized
  4. Preview: 2D Grid Accelerator Structure

    This is a short preview of 2D grid accelerator structure. It's primary use is for speeding up collision detection.

    The general concept is this:

    The full 2D space is partitioned into individual grid (the black lines). Each shape added to the grid has some minimal aligned bounding box (pictured as green outlines). Every grid square which overlaps this bounding box has the shape's reference added to it's list of shapes (red background). Now to check for collisions, you ...

    Updated April 8th, 2012 at 11:59 PM by helloworld922

    Categories
    Uncategorized
  5. Fun little optimization

    Disclaimer: While optimizations can be fun and addictive, determine if your particular application needs any before attempting to optimize it.

    I've always wondered if the Java compiler was capable of performing certain loop optimizations. So for fun, I picked a two of them (a simple permutation and loop unrolling) and tested them out.

    public class Test
    {
     
    	public static void main(String[] args)
    	{
    		final int DIM = 0x2000;
    ...

    Updated November 23rd, 2011 at 09:32 AM by helloworld922

    Categories
    Uncategorized
Page 2 of 4 FirstFirst 1234 LastLast