• C

# Fastest Texture Mapping Algorithm for WIN 32 Programming ?

I had implemented Texture mapping algorithm in Windows
WIN32.
It's performance is 400 polygons per one secound.
I want to know more fast Texture mapping algorithm for
Windows WIN 32 Programming except DIRECT 3D.
###### Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

Commented:
A very broad question.  400 polygons a second means nothing if one doesn't know the hardware and the size of polygons etc.  Also you don't say what algorithm you used, so its hard to say what others there are.

DirectX is probably a good way to go because it takes advantage of hardware acceleration etc where available - giving you better speeds than you can get under software alone.
0
Commented:
Use glide or open gl...

/Anders
0
Commented:
Use OpenGL.
0
Author Commented:
I don't want to use Direct X and OpenGL and 3D Hardware Accelerator. only C Language Program.
ploygon area is about 600 pixel.
use ST Fuction (UV Function ?) of Vector Operation

Get left vetor(LV), right vector(RV), point vector(PV) in Original Triangle

* Basic Algorithm is this one

in Original Triangle Get ST value..
PV = S * LV + T * RV

Get left vetor(LV'), right vector(RV') in Deform Triangle
Taget Vector PV' is
PV' = S * LV' + T * RV'

using PV'. we get Taget Point

0
Commented:
GO to http://www.oiri.demon.co.uk/texmap/texmap.htm
the above page introduces the Midpoint Algorithm which is commonly used for high speed drawing of lines and arcs. The technique is extended to provide fast true perspective texture mapping of the type used in games such as Doom, Descent and Quake. Code examples in C and 8086 assembler are included together with tables of timings. Speeds of about four times that for brute force calculation (two divides per pixel) are achieved without approximation.

Hope this helps ^|^

Terry

0

Experts Exchange Solution brought to you by