Sign In
Create Account
Follow Us on Twitter
Subscribe on Youtube
Hi, i am knowledgeable in C++ and C#.
4 replies to this topic
Back to top|
|
|
#2
Posted 13 January 2010 - 11:14 AM
Bartimäus
-
- Members
-
- 490 posts
Programming Expert
I had a problems with the WinApi in c++.
#3
Posted 13 January 2010 - 11:18 AM
wayx3
-
- Members
-
- 3 posts
Newbie
Yes, I have a plan for a project, I bet that will be interesting for you, let's keep in touch
#4
Posted 13 January 2010 - 01:22 PM
Walle
-
- Members
-
- 75 posts
Learning Programmer
I also have plans for a small project. I'm actually thinking out a way to define it as I type (I don't see any point in starting to code unless you know what you want, and what you need to do to get there). Basicly, I want to create an application to try out some different ways of generating CG (Computer Graphics).
My main idea is kind of a fractal implementation, although it will return something that is far away from a true fractal. Basicly, think of a bitmap (i.e. some kind of array or similar of 24-32 bit values) where the corners and n-number of randomized pixels are initialized with a position (ofc fixed for the corners) and a color. Then, midpoints within the triangles (that are created by joining the points to the corners) are to be found. I intend those to be "harmonic midpoints" rather than geometric midpoints.
That does inflict a problem for me though, since I have no idea how to find the harmonic midpoint. The geometric midpoint is easy to find through finding the cross of AM, BM and CM.But I have no idea how I would find the harmonic midpoint. This will be an obvious area of tinkering :)
Those harmonic midpoints would, apart from being base values for the "soon to come" color determination, also serve as spawn points for new triangles (i.e. by imagining "lines" from the harmonic midpoint to the 3 closest other points. This is a bit hard to explain without pictures). The new triangles created could be used to find new harmonic midpoints, or they could be used to define the property of the points found within the shape. This is ofc just a basic idea, and there will have to be a LOT of tinkering with the code. But as I stated, I'm not even ready to start coding yet. There's still a LOT to work out before I start coding.
By the way, anyone is welcome on this project (this is not the same as my "particle" project), it's going to be open source. The main idea is to try to create beautiful CG using relatively simple algorithms.
My main idea is kind of a fractal implementation, although it will return something that is far away from a true fractal. Basicly, think of a bitmap (i.e. some kind of array or similar of 24-32 bit values) where the corners and n-number of randomized pixels are initialized with a position (ofc fixed for the corners) and a color. Then, midpoints within the triangles (that are created by joining the points to the corners) are to be found. I intend those to be "harmonic midpoints" rather than geometric midpoints.
That does inflict a problem for me though, since I have no idea how to find the harmonic midpoint. The geometric midpoint is easy to find through finding the cross of AM, BM and CM.But I have no idea how I would find the harmonic midpoint. This will be an obvious area of tinkering :)
Those harmonic midpoints would, apart from being base values for the "soon to come" color determination, also serve as spawn points for new triangles (i.e. by imagining "lines" from the harmonic midpoint to the 3 closest other points. This is a bit hard to explain without pictures). The new triangles created could be used to find new harmonic midpoints, or they could be used to define the property of the points found within the shape. This is ofc just a basic idea, and there will have to be a LOT of tinkering with the code. But as I stated, I'm not even ready to start coding yet. There's still a LOT to work out before I start coding.
By the way, anyone is welcome on this project (this is not the same as my "particle" project), it's going to be open source. The main idea is to try to create beautiful CG using relatively simple algorithms.
________________________________________________
"I'm not young enough to know everything." - Oscar Wilde
"I'm not young enough to know everything." - Oscar Wilde
#5
Posted 14 January 2010 - 03:45 PM
Phenom01
-
- Members
-
- 2 posts
Newbie
Walle said:
I also have plans for a small project. I'm actually thinking out a way to define it as I type (I don't see any point in starting to code unless you know what you want, and what you need to do to get there). Basicly, I want to create an application to try out some different ways of generating CG (Computer Graphics).
My main idea is kind of a fractal implementation, although it will return something that is far away from a true fractal. Basicly, think of a bitmap (i.e. some kind of array or similar of 24-32 bit values) where the corners and n-number of randomized pixels are initialized with a position (ofc fixed for the corners) and a color. Then, midpoints within the triangles (that are created by joining the points to the corners) are to be found. I intend those to be "harmonic midpoints" rather than geometric midpoints.
That does inflict a problem for me though, since I have no idea how to find the harmonic midpoint. The geometric midpoint is easy to find through finding the cross of AM, BM and CM.But I have no idea how I would find the harmonic midpoint. This will be an obvious area of tinkering :)
Those harmonic midpoints would, apart from being base values for the "soon to come" color determination, also serve as spawn points for new triangles (i.e. by imagining "lines" from the harmonic midpoint to the 3 closest other points. This is a bit hard to explain without pictures). The new triangles created could be used to find new harmonic midpoints, or they could be used to define the property of the points found within the shape. This is ofc just a basic idea, and there will have to be a LOT of tinkering with the code. But as I stated, I'm not even ready to start coding yet. There's still a LOT to work out before I start coding.
By the way, anyone is welcome on this project (this is not the same as my "particle" project), it's going to be open source. The main idea is to try to create beautiful CG using relatively simple algorithms.
My main idea is kind of a fractal implementation, although it will return something that is far away from a true fractal. Basicly, think of a bitmap (i.e. some kind of array or similar of 24-32 bit values) where the corners and n-number of randomized pixels are initialized with a position (ofc fixed for the corners) and a color. Then, midpoints within the triangles (that are created by joining the points to the corners) are to be found. I intend those to be "harmonic midpoints" rather than geometric midpoints.
That does inflict a problem for me though, since I have no idea how to find the harmonic midpoint. The geometric midpoint is easy to find through finding the cross of AM, BM and CM.But I have no idea how I would find the harmonic midpoint. This will be an obvious area of tinkering :)
Those harmonic midpoints would, apart from being base values for the "soon to come" color determination, also serve as spawn points for new triangles (i.e. by imagining "lines" from the harmonic midpoint to the 3 closest other points. This is a bit hard to explain without pictures). The new triangles created could be used to find new harmonic midpoints, or they could be used to define the property of the points found within the shape. This is ofc just a basic idea, and there will have to be a LOT of tinkering with the code. But as I stated, I'm not even ready to start coding yet. There's still a LOT to work out before I start coding.
By the way, anyone is welcome on this project (this is not the same as my "particle" project), it's going to be open source. The main idea is to try to create beautiful CG using relatively simple algorithms.
