VoronoiGraphTest.java

/*
 * Copyright 2015 MovingBlocks
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *  http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package org.terasology.polyworld;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

import org.junit.Assert;
import org.junit.Before;
import org.junit.Test;
import org.terasology.math.geom.Rect2i;
import org.terasology.math.delaunay.Voronoi;
import org.terasology.math.geom.BaseVector2f;
import org.terasology.math.geom.ImmutableVector2f;
import org.terasology.math.geom.Rect2f;
import org.terasology.math.geom.Vector2f;
import org.terasology.polyworld.graph.Region;
import org.terasology.polyworld.graph.VoronoiGraph;

/**
 * Tests the correct representation of a {@link VoronoiGraph}
 */
public class VoronoiGraphTest extends GraphTest {

    protected List<Vector2f> points;

    @Before
    public void setup() {
        final int width = 512;
        final int height = 256;

        intBounds = Rect2i.createFromMinAndSize(0, 0, width, height);
        realBounds = Rect2f.createFromMinAndSize(intBounds.minX(), intBounds.minY(), intBounds.width(), intBounds.height());

        points = Arrays.asList(
                new Vector2f(128, 64), new Vector2f(384, 96),
                new Vector2f(224, 72), new Vector2f(256, 192),
                new Vector2f(128, 192), new Vector2f(384, 224));

        Voronoi v = new Voronoi(points, realBounds);
        graph = new VoronoiGraph(intBounds, v);
    }

    @Test
    public void testRegionAndSiteMatch() {
        List<Region> regions = graph.getRegions();
        Assert.assertEquals("Number of regions differs from number of input sites", points.size(), regions.size());
        for (Region reg : regions) {
            Assert.assertTrue(points.contains(reg.getCenter()));
        }
    }

    @Test
    public void testVoronoiLocations() {
        List<BaseVector2f> corners = new ArrayList<>();
        graph.getCorners().forEach(c -> corners.add(c.getLocation()));

        // check location of all corners that are inside
        Assert.assertTrue(corners.contains(new ImmutableVector2f(171, 128)));
        Assert.assertTrue(corners.contains(new ImmutableVector2f(192, 256)));
        Assert.assertTrue(corners.contains(new ImmutableVector2f(308, 256)));
        Assert.assertTrue(corners.contains(new ImmutableVector2f(332, 160)));
    }
}