Topic: Completion of a map by symmetry

gnarfk wrote:

1) In a edge , we have some algebrical informations (... altitude, bobs ...)

In my opinion we should think about the rotation of pure terrain first. Then we can think about other features. Filling the resources is quite fast. Much more faster than creating the terrain.

But altitude can be interpolated from non-approximated positions. So rotate the terrain we are interested in, then interpolate the heights of points. Without approximation of points.

2) The fields , we have the terrain type. you have to think the image of a field with your rotation. we have to find a way to keep neighbour fields neighbour ....

I had another- easier one - idea to do that. Steps to rotate:

1. User: choose some points on the border of rotated land
2. ? User: write the shape of the land (or: stright lines between the points? )
3. Computer: Calculate the points posistions from point 1. and approximate it to map net
4. Computer: Fill in the fields by specific type of terrain. Fields taken from inside the new shape taken from new points positions.

Possible features (I have ideas):

• choose type of terrain (one? mix?)
• choose flattening the borders to make them flat.
• adding other parts, not only terrain: bobs, resources, etc. in the same amount as in the original shape
• choose center point of rotation (around which we rotate)
• while rotating we can draw a mask with lines according to rotated and beeing rotating shape.

But : if we find a solution for the 90° rotation (which may be particular enough to find a trick) , we will have solutions for any multiple of 30° .

For me 45 deg is more important:

2 players: 180=360 deg 3 players: 120=260 deg 4 players: 90 deg 6 players: 60 deg *8 players: 45 deg

30 deg is for 12 players, but can be used in other ways, as well as other possibilities. (part of map has some kind of symmetry, other parts aren't the same.)

I like 8-players maps. Then I can play for a loooong time with the AI and like the game (I don't like short games).

einstein13
calculations & maps packages: http://wuatek.no-ip.org/~rak/widelands/
backup website files: http://kartezjusz.ddns.net/upload/widelands/

Top

Quote

gnarfk wrote:

einstein13 wrote:

I had another- easier one - idea to do that. Steps to rotate:

1. User: choose some points on the border of rotated land
2. ? User: write the shape of the land (or: stright lines between the points? )
3. Computer: Calculate the points posistions from point 1. and approximate it to map net
4. Computer: Fill in the fields by specific type of terrain. Fields taken from inside the new shape taken from new points positions.

are you sure that your new shape will have the same number of edges ? i think it is the most important . and i don't think it will be easy to have this.

No, I'm not sure about this, but I have to test it first.

Don't forget that we don't have only rotations. We can use translations and symmetries to create fair 8-player maps.

combinations i think of could be:

2-player : (...)

I know that it is important to have symmetries, but for me fixing rotations is much more complicated. Symmetries are quite easy to implement... I guess

Maybe not every, but if we know how to do rotations- symmetries will be much more easier to do

Translations is adding a vector- I can do it now, without thinking:

vector translatedVector(basicVector, translationVector){
    newVector={0,0}
    newVector[0]=basicVector[0]+translationVector[0]
    newVector[1]=basicVector[1]+translationVector[1]
    return(newVector)
    }

It is basing adding

einstein13
calculations & maps packages: http://wuatek.no-ip.org/~rak/widelands/
backup website files: http://kartezjusz.ddns.net/upload/widelands/

Top

Quote

Gnarfk? I have "simple" problem (to this topic!):

I have list of points, also I can easily have list of lines. This list creates a figure, shape. Then I pick one (random) point. How can I test if the point is inside the shape or outside?

Please consider two cases:

• The shape is a convex set
• The shape isn't a convex set (should we split it into triangles to have convex set? But what should be the formula for that?)

Of course the set has no "holes" inside, so it is... (can't remember the correct word for that )

einstein13
calculations & maps packages: http://wuatek.no-ip.org/~rak/widelands/
backup website files: http://kartezjusz.ddns.net/upload/widelands/

Top

Quote

that is easy one Now only solve one problem: how to count (or rather: notice) intersections? I have one possibility:

1. Get the two lines equations (p_i -> p_i+1, p_out -> p_test)
2. Solve the x or y (any) value of intersection point of those lines (if exists: condition a1!=a2)
3. Check if x is in range of (x_i, x_i+1), where p_i and p_i+1 are points defining the loop
4. If yes- we have intersection, no- the intersection is outside the line segment (is it the correct math word?)

This problem is quite complex for computing. Is there any easier way to calculate this?!

Why I ask those questions? the idea is to rotate whole shape (ex. square, triangle, complex shape), then find points inside the rotated shape. Then we will save the original shape (a bit approximated to zigzag plane) and -what is more important - save surface area (but one more operation is needed: small expansion by radius = 0.5 to each direciton)

einstein13
calculations & maps packages: http://wuatek.no-ip.org/~rak/widelands/
backup website files: http://kartezjusz.ddns.net/upload/widelands/

Top

Quote

as the systems will always be of the same type , and as they have everytime a solution, we can even write directly the formula of the solution in the 'solving part' , and then check if the solution is where it should.

The computation of this would not be very hard for a computer . the number of operations being not too big. We can extend this algorithm to shapes with holes. (instead of a list of points, give directly the list of equations of all the border-lines with the ranges)

On the same principle we will have things that could work on shapes with holes, or shapes with non-linear equation (circles , ellipses, other ...) as long as these equations could be computed , and where the ranges are well defined.

Notice : if you can describe your shape as a Union of disks , it will be very easy to compute your problem : a point is in the shape if its distance from one af the disks centers is shorter than its radius. But here , the problem is to find these disks for any type of shape ...

Top

Quote