It looks like you're new here. If you want to get involved, click one of these buttons!

- 141.2K All Categories
- 103.9K Programming Languages
- 6.5K Assembler Developer
- 1.9K Basic
- 40K C and C++
- 2.9K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.7K Java
- 4.1K Pascal
- 1.3K Perl
- 2K PHP
- 553 Python
- 37 Ruby
- 4.4K VB.NET
- 1.6K VBA
- 20.9K Visual Basic
- 2.6K Game programming
- 317 Console programming
- 93 DirectX Game dev
- 1 Minecraft
- 112 Newbie Game Programmers
- 2 Oculus Rift
- 9K Applications
- 1.8K Computer Graphics
- 748 Computer Hardware
- 3.5K Database & SQL
- 535 Electronics development
- 1.6K Matlab
- 628 Sound & Music
- 258 XML Development
- 3.3K Classifieds
- 199 Co-operative Projects
- 199 For sale
- 190 FreeLance Software City
- 1.9K Jobs Available
- 605 Jobs Wanted
- 213 Wanted
- 2.9K Microsoft .NET
- 1.8K ASP.NET
- 1.1K .NET General
- 3.4K Miscellaneous
- 7 Join the Team
- 356 Comments on this site
- 71 Computer Emulators
- 2.1K General programming
- 188 New programming languages
- 641 Off topic board
- 226 Mobile & Wireless
- 98 Android
- 126 Palm Pilot
- 340 Multimedia
- 156 Demo programming
- 184 MP3 programming
- Bash scripts
- 28 Cloud Computing
- 53 FreeBSD
- 1.7K LINUX programming
- 371 MS-DOS
- Shell scripting
- 321 Windows CE & Pocket PC
- 4.1K Windows programming
- 944 Software Development
- 417 Algorithms
- 68 Object Orientation
- 92 Project Management
- 95 Quality & Testing
- 271 Security
- 7.7K WEB-Development
- 1.8K Active Server Pages
- 62 AJAX
- 6 Bootstrap Themes
- 55 CGI Development
- 28 ColdFusion
- 224 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 37 JQuery
- 310 WEB Servers
- 157 WEB-Services / SOAP

The Ultramage
Member Posts: **10**

in 3D Graphics

I've developed a genial method of determining which polygons' color should be used to draw using the s-buffer algorithm.

The problem is that something is wrong - either in the algorithm or in my program.

Could someone skilled in this area reply? Then I could specify the algorithm.

THANKS

The problem is that something is wrong - either in the algorithm or in my program.

Could someone skilled in this area reply? Then I could specify the algorithm.

THANKS

Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven

© 1997-2017 Programmersheaven.com - All rights reserved.

## Comments

1210When doing the s_buffer, it can happen that two polygons intersect (like 2 sides of a cube). Calculating depth won't work, because the 2 polys have the same depth at the questioned point.

My solution goes:

Find the second intersection of each polygon and the scanned line.

Then, check the z value of each of them.

The polygon whose second intersector's depth is lower is the closer one.

So draw the x(i) - x(i+1) segment with that polygon's color.

End.

Try to draw some examples of polygons whose sides are intersecting.

You'll see that it works.

I tried to calculate the z coordinate by iteration (I know the z-s of the starting and the ending point of each side of each polygon), but it didn't seem to work.

I think I even tried to brute-calculate the z and it didn't work.

Example: I'm looking at two polygons that intersect. The problem is that when I rotate the eye a little, the engine first shows the first polygon, then the second, and so on.

It seems that at some points, the algorithm doesn't take the last side of the polygon into account. Then it does. Then it doesn't.

Try to find an error in my algorithm. If you didn't find it, I could post a screenshot of the problem if you wish.

The Ultramage

271) You should not need to check any z when it's an adjacency problem between two polygons on an edge. IF the two polygones share the same vertex coordinates and use the same transformation pipeline. Because the left (thin) edge for P1 and right (thin) edge for P2 are the same. So this edge should clearly define which pixels project on P1 or P2. Like this :

11111222

11112222

11112222

11122222

2) Even tho how do you compute z ?

I suspect you do this 3D lamer approximation : you must not linearily interpolate z on your edge ! That's false. You have to consider the discrete position of the first pixel drawn.

For instance :

On the edge (infinitely thin) : x=0.1 y=0.5

First pixel coordinate : x'=0.5 (first pixel) y=0.5

Consider here that 0.5 0.5 is the coordinate of the top left pixel of the screen.

As there is a 0.4 difference between x and x', z(x,y)<>z(x',y)

That's so OBVIOUS !

If you want compute an efficient 1/z (or 1/w) value for (inverse) depth comparison on the starting pixels of a Bresenham line, I have found a very nice trick. It looks like that in C.

When persp correction is taken :

1/w, u/w, v/w (w homogenous coordinate) are linear gradients in x,y :

1/w = a*x + b*y + c;

....

x_frac+=xinc_frac; // a 1.31 fixed point value

bit = xfrac>>31; // bit is 0 or 1

// in asm one could use a add adc sequence to get this overflow bit.

oow += oowStep[bit]; // fixed point arithmetic

uow += uowStep[bit];

vow += vowStep[bit];

// Only 1 addition (1 cycle) per line start and mapped coordinate used.

3) Its maybe time for you to forget about s-buffers and so on. These techs were used 8 years ago, ... unless you absolutely need an optimized software 3D engine. Then I am a well of science about these questions if you need more and even some code samples.

0✭[ http://forcoder.org ] free video tutorials and ebooks about [ Visual Basic .NET, C++, Java, Assembly, Scratch, PL/SQL, R, MATLAB, Perl, Go, Delphi, C, JavaScript, C#, Objective-C, PHP, Swift, Ruby, Python, Visual Basic Scheme, Dart, Lua, Transact-SQL, Hack, Scala, LabVIEW, Bash, Erlang, Apex, FoxPro, Ada, ML, VBScript, ABAP, Kotlin, Logo, COBOL, D, Crystal, Prolog, Awk, F#, Lisp, Rust, Alice, Fortran, Clojure, Julia, SAS ] ________