Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

Fastest Texture Mapping Algorithm for WIN 32 Programming ?

Posted on 1998-02-01
5
Medium Priority
?
381 Views
Last Modified: 2008-02-20
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.
0
Comment
Question by:jhjeon
5 Comments
 
LVL 10

Expert Comment

by:RONSLOW
ID: 1257156
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
 

Expert Comment

by:andersh012098
ID: 1257157
Use glide or open gl...

/Anders
0
 
LVL 4

Expert Comment

by:marko020397
ID: 1257158
Use OpenGL.
0
 

Author Comment

by:jhjeon
ID: 1257159
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
 
LVL 3

Accepted Solution

by:
q2guo earned 20 total points
ID: 1257160
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

Featured Post

VIDEO: THE CONCERTO CLOUD FOR HEALTHCARE

Modern healthcare requires a modern cloud. View this brief video to understand how the Concerto Cloud for Healthcare can help your organization.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Have you thought about creating an iPhone application (app), but didn't even know where to get started? Here's how: ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ Important pre-programming comments: I’ve never tri…
This tutorial is posted by Aaron Wojnowski, administrator at SDKExpert.net.  To view more iPhone tutorials, visit www.sdkexpert.net. This is a very simple tutorial on finding the user's current location easily. In this tutorial, you will learn ho…
The goal of this video is to provide viewers with basic examples to understand and use pointers in the C programming language.
The goal of this video is to provide viewers with basic examples to understand and use conditional statements in the C programming language.

926 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question