• Announcements

    • khawk

      Download the Game Design and Indie Game Marketing Freebook   07/19/17

      GameDev.net and CRC Press have teamed up to bring a free ebook of content curated from top titles published by CRC Press. The freebook, Practices of Game Design & Indie Game Marketing, includes chapters from The Art of Game Design: A Book of Lenses, A Practical Guide to Indie Game Marketing, and An Architectural Approach to Level Design. The GameDev.net FreeBook is relevant to game designers, developers, and those interested in learning more about the challenges in game development. We know game development can be a tough discipline and business, so we picked several chapters from CRC Press titles that we thought would be of interest to you, the GameDev.net audience, in your journey to design, develop, and market your next game. The free ebook is available through CRC Press by clicking here. The Curated Books The Art of Game Design: A Book of Lenses, Second Edition, by Jesse Schell Presents 100+ sets of questions, or different lenses, for viewing a game’s design, encompassing diverse fields such as psychology, architecture, music, film, software engineering, theme park design, mathematics, anthropology, and more. Written by one of the world's top game designers, this book describes the deepest and most fundamental principles of game design, demonstrating how tactics used in board, card, and athletic games also work in video games. It provides practical instruction on creating world-class games that will be played again and again. View it here. A Practical Guide to Indie Game Marketing, by Joel Dreskin Marketing is an essential but too frequently overlooked or minimized component of the release plan for indie games. A Practical Guide to Indie Game Marketing provides you with the tools needed to build visibility and sell your indie games. With special focus on those developers with small budgets and limited staff and resources, this book is packed with tangible recommendations and techniques that you can put to use immediately. As a seasoned professional of the indie game arena, author Joel Dreskin gives you insight into practical, real-world experiences of marketing numerous successful games and also provides stories of the failures. View it here. An Architectural Approach to Level Design This is one of the first books to integrate architectural and spatial design theory with the field of level design. The book presents architectural techniques and theories for level designers to use in their own work. It connects architecture and level design in different ways that address the practical elements of how designers construct space and the experiential elements of how and why humans interact with this space. Throughout the text, readers learn skills for spatial layout, evoking emotion through gamespaces, and creating better levels through architectural theory. View it here. Learn more and download the ebook by clicking here. Did you know? GameDev.net and CRC Press also recently teamed up to bring GDNet+ Members up to a 20% discount on all CRC Press books. Learn more about this and other benefits here.
Sign in to follow this  
Followers 0
SingularOne

OpenGL
Rotation Matrix about point

12 posts in this topic

Hey, would you help me a bit? I'm struggling with making matrices to rotate about point. My rotation part of the matrix construction looks like that:

[code]

boneMatrices[offs + 0] = cos(rx) * cos(ry);


boneMatrices[offs + 1] = -cos(rz) * sin(rx) - cos(rx)*sin(ry)*sin(rz);
boneMatrices[offs + 2] = cos(rx) * cos(rz) * sin(ry) + sin(rx) * sin(rz);

boneMatrices[offs + 4] = cos(ry) * sin(rx);
boneMatrices[offs + 5] = cos(rx) * cos(rz) - sin(rx)*sin(ry)*sin(rz);
boneMatrices[offs + 6] = cos(rz) * sin(rx) * sin(ry) - cos(rx) * sin(rz);

boneMatrices[offs + 8] = -sin(ry);
boneMatrices[offs + 9] = cos(ry) * sin(rz);
boneMatrices[offs + 10] = cos(ry) * cos(rz);
[/code]

I pass origin for rotation instead of scaling part of the matrix, and then, in vertex shader i do:

1) subtract origin from vertex

2) rotate vertex

3) add origin to vertex

It works, but it sucks. too much operations, ugly code;

I want to pass to my shader matrices that already do rotation about specific point. but really i need someone's help here. how can i make above matrix to rotate about specific point? i couldn't find any descriprion adoptable in my case.




i use opengl, if it matters.
0

Share this post


Link to post
Share on other sites
Assuming that you use column vectors, if [b]T[/b]([b]c[/b]) is the translation matrix to the center of rotation and [b]R[/b] is the rotation matrix, then the product
[b]M[/b] := [b]T[/b]([b]c[/b]) * [b]R[/b] * [b]T[/b](-[b]c[/b])
defines the desired new rotation matrix. It translates by -[b]c[/b], rotates, and translates back by [b]c[/b] like you do now separately.

EDIT:
You can take advantage from knowing the structures of the matrices when you compute the above product. Think of [b]M[/b] having a 3x3 sub-marix [b]M[/b][sub]R[/sub] on the upper left and a 1x3 sub-matrix [b]M[/b][sub]T[/sub] on the upper right, and doing so with [b]R[/b] and [b]T[/b] as well, then
[b]M[/b][sub]R[/sub] := [b]R[/b][sub]R[/sub]
[b]M[/b][sub]T[/sub] := [b]R[/b][sub]R[/sub] * [b]T[/b][sub]T[/sub](-[b]c[/b]) + [b]T[/b][sub]T[/sub]([b]c[/b])
means the minimum computations to be done for yielding in [b]M[/b].
1

Share this post


Link to post
Share on other sites
[quote name='SingularOne' timestamp='1313475830' post='4849719']
1) subtract origin from vertex

2) rotate vertex

3) add origin to vertex

[/quote]

I know you might not want to hear this, but the way you listed above is the correct way. If you want your code to still look good, you can write it like this (writen in psuedocode of course):

[code]
function RotateAboutPoint(Point,Rotation){
return MoveToAxis * Rotate * MoveFromAxis;
}
[/code]

It might even perform better than your "beautiful" code since matrix multiplication is accelerated while multiplying every element in your matrix separately is not... (Not sure about this one though...)
0

Share this post


Link to post
Share on other sites
Thanks for your replies.

Well i've tried to do it like [b]haegarr [/b]described:




[code]

//Origins

oMat.make_identity();
oMat2.make_identity();

oMat.element(0, 3) = -ox;
oMat.element(1, 3) = -oy;
oMat.element(2, 3) = -oz;

oMat2.element(0, 3) = ox;
oMat2.element(1, 3) = oy;
oMat2.element(2, 3) = oz;


//Rotation(tested)
bMat.make_identity();

bMat.element(0, 0) = cos(rx) * cos(ry);
bMat.element(1, 0) = -cos(rz) * sin(rx) - cos(rx)*sin(ry)*sin(rz);
bMat.element(2, 0) = cos(rx) * cos(rz) * sin(ry) + sin(rx) * sin(rz);;
bMat.element(0, 1) = cos(ry) * sin(rx);
bMat.element(1, 1) = cos(rx) * cos(rz) - sin(rx)*sin(ry)*sin(rz);
bMat.element(2, 1) = cos(rz) * sin(rx) * sin(ry) - cos(rx) * sin(rz);
bMat.element(0, 2) = -sin(ry);
bMat.element(1, 2) = cos(ry) * sin(rz);
bMat.element(2, 2) = cos(ry) * cos(rz);

//Bone translation

bMat.element(0, 3) = translation.x;
bMat.element(1, 3) = translation.y;
bMat.element(2, 3) = translation.z;


//M := R * T(-c) + T© ??
bMat *= oMat;
bMat += oMat2;[/code]


[b]and rotation\translation is now rigth, but for some reason i[u][color="#8b0000"]t's about 2x weaker than it should be and it looks like it scales vertices a bit then rotating[/color][/u][/b]
0

Share this post


Link to post
Share on other sites
[quote name='SingularOne' timestamp='1313485221' post='4849759']
[code]

bMat *= oMat;
bMat += oMat2;[/code]

[/quote]

Why are you adding? All matrix chaining transformations should be multiplications...
1

Share this post


Link to post
Share on other sites
Ok, fixed by


[code]
bMat *= oMat;
oMat2 *= bMat;
bMat = oMat2;//(or just pass oMat2 to shader)[/code]

(equialent of -T * R * T)

but i'm not sure if it's ok to use such a matrix for tangent and normal? looks ok, but just want to know.
0

Share this post


Link to post
Share on other sites
[quote name='SillyCow' timestamp='1313504494' post='4849857']
[quote name='SingularOne' timestamp='1313485221' post='4849759']
[code]
bMat *= oMat;
bMat += oMat2;[/code]
[/quote]

Why are you adding? All matrix chaining transformations should be multiplications...
[/quote]
[font="arial, verdana, tahoma, sans-serif"][size="2"]Please let me clarify what
[color="#1C2837"][size="2"][b]M[/b][sub]T[/sub] := [b]R[/b][sub]R[/sub] * [b]T[/b][sub]T[/sub](-[b]c[/b]) + [b]T[/b][sub]T[/sub]([b]c[/b])[/size][/color][/size][/font]
actually means. As mentioned my post above, [color="#1C2837"][size="2"][b]R[/b][sub]R[/sub][/size][/color] is a 3x3 matrix and [color="#1C2837"][size="2"][b]T[/b][sub]T[/sub][/size][/color] is a 1x3 matrix (a.k.a. column vector). Multiplying a 3x3 matrix on the left and a 1x3 matrix on the right gives you a 1x3 matrix. Adding a 1x3 matrix onto a 1x3 matrix gives you a 1x3 matrix.

So notice that the result [color="#1C2837"][size="2"][b]M[/b][sub]T[/sub][/size][/color] is a 1x3 matrix (and that [color="#1C2837"][size="2"][b]M[/b][sub]R[/sub][/size][/color] is a 3x3 matrix), while [b]M[/b] itself is a usual homogeneous 4x4 matrix. The correct assembly then looks like
[code]
bMat.make_identity();
// MR
bMat.element(0, 0) = cos(rx) * cos(ry);
bMat.element(1, 0) = -cos(rz) * sin(rx) - cos(rx)*sin(ry)*sin(rz);
bMat.element(2, 0) = cos(rx) * cos(rz) * sin(ry) + sin(rx) * sin(rz);;
bMat.element(0, 1) = cos(ry) * sin(rx);
bMat.element(1, 1) = cos(rx) * cos(rz) - sin(rx)*sin(ry)*sin(rz);
bMat.element(2, 1) = cos(rz) * sin(rx) * sin(ry) - cos(rx) * sin(rz);
bMat.element(0, 2) = -sin(ry);
bMat.element(1, 2) = cos(ry) * sin(rz);
bMat.element(2, 2) = cos(ry) * cos(rz);
// MT = MR * TT(-c) + TT(c)
bMat.element(0, 3) = bMat.element(0, 0) * (-ox) + bMat.element(0, 1) * (-oy) + bMat.element(0, 2) * (-oz) + ox;
bMat.element(1, 3) = bMat.element(1, 0) * (-ox) + bMat.element(1, 1) * (-oy) + bMat.element(1, 2) * (-oz) + oy;
bMat.element(2, 3) = bMat.element(2, 0) * (-ox) + bMat.element(2, 1) * (-oy) + bMat.element(2, 2) * (-oz) + oz;
[/code]
if I have interpreted the indexing scheme correctly.


EDIT: It is for sure possible to compose the desired rotation simply by computing [color="#1C2837"][size="2"][b]T[/b]([b]c[/b]) * [b]R[/b] * [b]T[/b](-[b]c[/b])[/size][/color]. The above way just shows (as mentioned) the minimal computational effort to do; it avoids all that nasty scalar products with 0 and 1. However, this kind of optimization will probably not be noticeable.
1

Share this post


Link to post
Share on other sites
[color="#1C2837"][size="2"][b] [url="http://www.gamedev.net/user/90444-haegarr/"]haegarr[/url],[/b]
i don't know how to thank you for your effort, your method works fine and it's much more efficient[/size][/color]
[size="2"][color="#1c2837"]
[b][url="http://www.gamedev.net/user/144405-sillycow/"]SillyCow[/url],[/b]
thank you too for pointing out the part i misunderstood.[/color][/size]
[size="2"] [/size]
[size="2"][color="#1c2837"]and yeah, i've alredy noticed, that it's not really good to rotate normals.[/color][/size]
0

Share this post


Link to post
Share on other sites
[quote name='SingularOne' timestamp='1313506514' post='4849879']
...
(equialent of -T * R * T)

but i'm not sure if it's ok to use such a matrix for tangent and normal? looks ok, but just want to know.
[/quote]
Well, please notice that -[b]T[/b] is not the same as [b]T[/b](-[b]c[/b]), because the elements on the main diagonal will be negated in -[b]T[/b] but not in [b]T[/b](-[b]c[/b])!

However, you can apply [b]T[/b](-[b]c[/b]) * [b]R[/b] * [b]T[/b]([b]c[/b]) to a normal / tangent because
a) normals and tangents are direction vectors and are hence invariant to translations, and
b) there is no scaling or shearing in this formula.
Hence for normals and tangents the above formula does the same as the lonely [b]R[/b] does: It simply rotates the vector.
0

Share this post


Link to post
Share on other sites
yes it looks like problem is in my shader.

here shader that i found in nvidia example of hardware skinning:


[code]
attribute vec4 position;
attribute vec3 normal;
attribute vec4 weight;
attribute vec4 index;
attribute float numBones;

uniform mat4 boneMatrices[30];
uniform vec4 color;
uniform vec4 lightPos;

void main()
{
vec4 transformedPosition = vec4(0.0);
vec3 transformedNormal = vec3(0.0);

vec4 curIndex = index;
vec4 curWeight = weight;

for (int i = 0; i < int(numBones); i++)
{
mat4 m44 = boneMatrices[int(curIndex.x)];

// transform the offset by bone i
transformedPosition += m44 * position * curWeight.x;

mat3 m33 = mat3(m44[0].xyz,
m44[1].xyz,
m44[2].xyz);

// transform normal by bone i
transformedNormal += m33 * normal * curWeight.x;

// shift over the index/weight variables, this moves the index and
// weight for the current bone into the .x component of the index
// and weight variables
curIndex = curIndex.yzwx;
curWeight = curWeight.yzwx;
}

gl_Position = gl_ModelViewProjectionMatrix * transformedPosition;

transformedNormal = normalize(transformedNormal);
gl_FrontColor = dot(transformedNormal, lightPos.xyz) * color;
}[/code]


and significant part of my adoption(maximum 2 bones affecting vertex, 1st one is always most effective, so 2nd affecting bone might exist only if 1st one is):

[code] V = gl_Vertex;
vec3 n2 = gl_Normal;
vec3 t2 = Tangent;
if(Bones.x >= 0.0)//Bone1 ID
{
mat4 tmat = BonesMat[int(Bones.x)]; //Bone matrix
mat3 nmat = mat3(tmat[0].xyz, tmat[1].xyz, tmat[2].xyz);

V = tmat * gl_Vertex * Bones.z; //Bones.z - Bone 1 weight
n2 = nmat * gl_Normal * Bones.z;
t2 = nmat * Tangent * Bones.z;

if(Bones.y >= 0.0)//Bone2 ID
{
tmat = BonesMat[int(Bones.y)];
nmat = mat3(tmat[0].xyz, tmat[1].xyz, tmat[2].xyz);

V += tmat * gl_Vertex * Bones.w; //Bones.w - Bone2 weight
n2 += nmat * gl_Normal * Bones.w;
t2 += nmat * Tangent * Bones.w;
}
}
[/code]
Further - using V,N,T as regular;

result: rotation\translation is alright.
problem: lighting glitches. then i move camera away from object - vertices that affected by 2 bones become dark with the distance(lambert decreasing).
0

Share this post


Link to post
Share on other sites
IMHO the shown adopted code snippet is missing a normalization of both n2 and t2 (assuming that "using V,N,T as regular" doesn't include it). The code snippet probably only works well if Bones.z == 1 and Bones.y < 0. In all other cases the lengths of n2 and t2 may be anything but are later expected to be 1.
1

Share this post


Link to post
Share on other sites
yes, i've noticed before, it works ok if bone1 weight = 1.0 and bone2 is ineffective, but i do normalize resulting normal and tangent


[code]

vec3 T = normalize(gl_NormalMatrix * normalize(t2));
vec3 N = normalize(gl_NormalMatrix * normalize(n2));
vec3 B = cross(N, T);[/code]


and even if i remove normal rotation, problem doesn't go away.
also i modified code so second bone weight = 1.0 - FirstBoneWeight (because outside shader my program actually calculates weights for all affecting bones, but in examples i use to test it's always <= 2 bones affecting vertex);

and to avoid wasting your time with snippets:
full code of stuff that actually affects that problem,
[spoiler]
[code]#version 110
attribute vec4 Bones;
attribute vec3 Tangent;
uniform mat4 BonesMat[30];
varying vec3 ld;
varying vec3 eye;
varying vec4 V;

void main()
{
V = gl_Vertex;
vec3 n2 = gl_Normal;
vec3 t2 = Tangent;
if(Bones.x >= 0.0)
{
mat4 tmat = BonesMat[int(Bones.x)];
mat3 nmat = mat3(tmat[0].xyz, tmat[1].xyz, tmat[2].xyz);

V = tmat * gl_Vertex * Bones.z;
n2 = nmat * gl_Normal * Bones.z;
t2 = nmat * Tangent * Bones.z;

if(Bones.y >= 0.0)
{
tmat = BonesMat[int(Bones.y)];
nmat = mat3(tmat[0].xyz, tmat[1].xyz, tmat[2].xyz);

V += tmat * gl_Vertex * (1.0-Bones.z);
n2 += nmat * gl_Normal * (1.0-Bones.z);
t2 += nmat * Tangent * (1.0-Bones.z);
}
}

gl_TexCoord[0] = gl_MultiTexCoord0;
V = gl_ModelViewMatrix * V;

vec3 T = -normalize(gl_NormalMatrix * normalize(t2));
vec3 N = normalize(gl_NormalMatrix * normalize(n2));
vec3 B = cross(N, T);

vec3 lv = (gl_LightSource[0].position - V).xyz;
ld.x = dot(lv, B);
ld.y = dot(lv, T);
ld.z = dot(lv, N);

vec3 vt = -V.xyz;
eye.x = dot(vt, B);
eye.y = dot(vt, T);
eye.z = dot(vt, N);
gl_Position = gl_ProjectionMatrix * V;
}[/code]

[/spoiler]
0

Share this post


Link to post
Share on other sites
The problem was i'm using 3-component vectors for all my lighting calculation, so vertex w-component was modified by rotation matrix correctly, but wasn't affecting lighting. so i should do it manually.
0

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!


Register a new account

Sign in

Already have an account? Sign in here.


Sign In Now
Sign in to follow this  
Followers 0

  • Similar Content

    • By mapra99
      Hello

      I am working on a recent project and I have been learning how to code in C# using OpenGL libraries for some graphics. I have achieved some quite interesting things using TAO Framework writing in Console Applications, creating a GLUT Window. But my problem now is that I need to incorporate the Graphics in a Windows Form so I can relate the objects that I render with some .NET Controls.

      To deal with this problem, I have seen in some forums that it's better to use OpenTK instead of TAO Framework, so I can use the glControl that OpenTK libraries offer. However, I haven't found complete articles, tutorials or source codes that help using the glControl or that may insert me into de OpenTK functions. Would somebody please share in this forum some links or files where I can find good documentation about this topic? Or may I use another library different of OpenTK?

      Thanks!
    • By Solid_Spy
      Hello, I have been working on SH Irradiance map rendering, and I have been using a GLSL pixel shader to render SH irradiance to 2D irradiance maps for my static objects. I already have it working with 9 3D textures so far for the first 9 SH functions.
      In my GLSL shader, I have to send in 9 SH Coefficient 3D Texures that use RGBA8 as a pixel format. RGB being used for the coefficients for red, green, and blue, and the A for checking if the voxel is in use (for the 3D texture solidification shader to prevent bleeding).
      My problem is, I want to knock this number of textures down to something like 4 or 5. Getting even lower would be a godsend. This is because I eventually plan on adding more SH Coefficient 3D Textures for other parts of the game map (such as inside rooms, as opposed to the outside), to circumvent irradiance probe bleeding between rooms separated by walls. I don't want to reach the 32 texture limit too soon. Also, I figure that it would be a LOT faster.
      Is there a way I could, say, store 2 sets of SH Coefficients for 2 SH functions inside a texture with RGBA16 pixels? If so, how would I extract them from inside GLSL? Let me know if you have any suggestions ^^.
    • By KarimIO
      EDIT: I thought this was restricted to Attribute-Created GL contexts, but it isn't, so I rewrote the post.
      Hey guys, whenever I call SwapBuffers(hDC), I get a crash, and I get a "Too many posts were made to a semaphore." from Windows as I call SwapBuffers. What could be the cause of this?
      Update: No crash occurs if I don't draw, just clear and swap.
      static PIXELFORMATDESCRIPTOR pfd = // pfd Tells Windows How We Want Things To Be { sizeof(PIXELFORMATDESCRIPTOR), // Size Of This Pixel Format Descriptor 1, // Version Number PFD_DRAW_TO_WINDOW | // Format Must Support Window PFD_SUPPORT_OPENGL | // Format Must Support OpenGL PFD_DOUBLEBUFFER, // Must Support Double Buffering PFD_TYPE_RGBA, // Request An RGBA Format 32, // Select Our Color Depth 0, 0, 0, 0, 0, 0, // Color Bits Ignored 0, // No Alpha Buffer 0, // Shift Bit Ignored 0, // No Accumulation Buffer 0, 0, 0, 0, // Accumulation Bits Ignored 24, // 24Bit Z-Buffer (Depth Buffer) 0, // No Stencil Buffer 0, // No Auxiliary Buffer PFD_MAIN_PLANE, // Main Drawing Layer 0, // Reserved 0, 0, 0 // Layer Masks Ignored }; if (!(hDC = GetDC(windowHandle))) return false; unsigned int PixelFormat; if (!(PixelFormat = ChoosePixelFormat(hDC, &pfd))) return false; if (!SetPixelFormat(hDC, PixelFormat, &pfd)) return false; hRC = wglCreateContext(hDC); if (!hRC) { std::cout << "wglCreateContext Failed!\n"; return false; } if (wglMakeCurrent(hDC, hRC) == NULL) { std::cout << "Make Context Current Second Failed!\n"; return false; } ... // OGL Buffer Initialization glClear(GL_DEPTH_BUFFER_BIT | GL_COLOR_BUFFER_BIT); glBindVertexArray(vao); glUseProgram(myprogram); glDrawElements(GL_TRIANGLES, indexCount, GL_UNSIGNED_SHORT, (void *)indexStart); SwapBuffers(GetDC(window_handle));  
    • By Tchom
      Hey devs!
       
      I've been working on a OpenGL ES 2.0 android engine and I have begun implementing some simple (point) lighting. I had something fairly simple working, so I tried to get fancy and added color-tinting light. And it works great... with only one or two lights. Any more than that, the application drops about 15 frames per light added (my ideal is at least 4 or 5). I know implementing lighting is expensive, I just didn't think it was that expensive. I'm fairly new to the world of OpenGL and GLSL, so there is a good chance I've written some crappy shader code. If anyone had any feedback or tips on how I can optimize this code, please let me know.
       
      Vertex Shader
      uniform mat4 u_MVPMatrix; uniform mat4 u_MVMatrix; attribute vec4 a_Position; attribute vec3 a_Normal; attribute vec2 a_TexCoordinate; varying vec3 v_Position; varying vec3 v_Normal; varying vec2 v_TexCoordinate; void main() { v_Position = vec3(u_MVMatrix * a_Position); v_TexCoordinate = a_TexCoordinate; v_Normal = vec3(u_MVMatrix * vec4(a_Normal, 0.0)); gl_Position = u_MVPMatrix * a_Position; } Fragment Shader
      precision mediump float; uniform vec4 u_LightPos["+numLights+"]; uniform vec4 u_LightColours["+numLights+"]; uniform float u_LightPower["+numLights+"]; uniform sampler2D u_Texture; varying vec3 v_Position; varying vec3 v_Normal; varying vec2 v_TexCoordinate; void main() { gl_FragColor = (texture2D(u_Texture, v_TexCoordinate)); float diffuse = 0.0; vec4 colourSum = vec4(1.0); for (int i = 0; i < "+numLights+"; i++) { vec3 toPointLight = vec3(u_LightPos[i]); float distance = length(toPointLight - v_Position); vec3 lightVector = normalize(toPointLight - v_Position); float diffuseDiff = 0.0; // The diffuse difference contributed from current light diffuseDiff = max(dot(v_Normal, lightVector), 0.0); diffuseDiff = diffuseDiff * (1.0 / (1.0 + ((1.0-u_LightPower[i])* distance * distance))); //Determine attenuatio diffuse += diffuseDiff; gl_FragColor.rgb *= vec3(1.0) / ((vec3(1.0) + ((vec3(1.0) - vec3(u_LightColours[i]))*diffuseDiff))); //The expensive part } diffuse += 0.1; //Add ambient light gl_FragColor.rgb *= diffuse; } Am I making any rookie mistakes? Or am I just being unrealistic about what I can do? Thanks in advance
    • By yahiko00
      Hi,
      Not sure to post at the right place, if not, please forgive me...
      For a game project I am working on, I would like to implement a 2D starfield as a background.
      I do not want to deal with static tiles, since I plan to slowly animate the starfield. So, I am trying to figure out how to generate a random starfield for the entire map.
      I feel that using a uniform distribution for the stars will not do the trick. Instead I would like something similar to the screenshot below, taken from the game Star Wars: Empire At War (all credits to Lucasfilm, Disney, and so on...).

      Is there someone who could have an idea of a distribution which could result in such a starfield?
      Any insight would be appreciated
  • Popular Now