Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
A Texture Mapping Algorithm
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  2 messages - Collapse all  -  Translate all to Translated (View all originals)
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Daniel Piponi  
View profile  
 More options Jul 19 1994, 8:47 am
Newsgroups: comp.graphics.algorithms
From: dpdp19...@ggr.co.uk (Daniel Piponi)
Date: 19 Jul 1994 07:43:06 -0500
Local: Tues, Jul 19 1994 8:43 am
Subject: A Texture Mapping Algorithm
I don't have easy access to computer graphics journals so I'm wondering
if anyone else has tried, or might find useful, my approach to perspective
texture mapping.

Most posts on the subject seem to refer to using quadratic interpolation
to handle the perspective mapping. I have an essentially linear approach.
Suppose we wish to texture map a triangle in 3-space onto the screen
using the map pi:(x,y,z) -> (x/z,y/z). Let L be the line segment that is the
intersection of this triangle with the plane z=k. Then pi restricted to L
is an affine map. If we then rule the triangle with lines parallel to L
we can use an affine map to render each line to the screen. Instead of
using horizontal scan lines, say, we have to use non-horizontal lines.
But this is at virtually no extra cost because all of these lines are
parallel and we can precompute the coordinates of one of these lines
right at the beginning of the texture map. We have to do a division or
two at the beginning of each line to compute the texture coordinates of
the endpoints but then it's simple additions all the way.

The net result is persepctive texture mapping needing approximately two
divisions at the end of each line and about 4 additions per pixel. It is
fast and accurate - probably good enough for games.

I haven't thought about anti-aliasing yet.

Any interest? Is it novel?

Dan Piponi / dpdp19...@ggr.co.uk / d...@tanelorn.demon.co.uk
--
`We speak of birds singing. When I was a boy I was often bothered in
listening to birds because it obviously isn't *singing*. Finally someone
said to me, "All right, don't call it singing, call it something
else". And soon I could listen to birds and enjoy it.' -- L Wittgenstein


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Bernie Roehl  
View profile  
 More options Jul 20 1994, 12:02 am
Newsgroups: comp.graphics.algorithms
From: bro...@sunee.uwaterloo.ca (Bernie Roehl)
Date: Wed, 20 Jul 1994 03:21:03 GMT
Local: Tues, Jul 19 1994 11:21 pm
Subject: Re: A Texture Mapping Algorithm
In article <Pine.3.89.9407191300.A25462-0100000@uk6x25>,

Daniel Piponi <dpdp19...@ggr.co.uk> wrote:
>Suppose we wish to texture map a triangle in 3-space onto the screen
>using the map pi:(x,y,z) -> (x/z,y/z). Let L be the line segment that is the
>intersection of this triangle with the plane z=k. Then pi restricted to L
>is an affine map. If we then rule the triangle with lines parallel to L
>we can use an affine map to render each line to the screen. Instead of
>using horizontal scan lines, say, we have to use non-horizontal lines.
>Any interest? Is it novel?

The PC-GPE (found on x2ftp.oulu.fi) has an article on "Free-Direction Texture
Mapping" that is a more detailed description of the algorithm you describe.
It's a good idea.
--
        Bernie Roehl
        University of Waterloo Dept of Electrical and Computer Engineering
        Mail: bro...@UWaterloo.ca
        Voice:  (519) 888-4567 x 2607 [work]

 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »