Take the 2-minute tour ×
Programmers Stack Exchange is a question and answer site for professional programmers interested in conceptual questions about software development. It's 100% free, no registration required.

I'm trying to implement the version of Appel's algorithm for vector hidden line removal (i.e. I'd like to avoid any form of rasterization). I found the description of this algorithm here - http://wheger.tripod.com/vhl/vhl.htm but it doesn't mention how to actually deal with implementation and I'm having a difficulty with this... To be more precise - how can I write a code (well, even at least pseudocode) that in result will yield that "All the faces are subdivided into subfaces such that all points in the interior of this subface are either front facing or back facing"? And - "Hence when traversing an edge segment, the visibility increments when going under a body and decrements when coming out from underneath" - do I have to simulate "traversing" an edge? What is the idea in implementation that lays behind it?

And, basically, this description is a bit overwhelming for me since it has scant images and pseudocodes so if you can share with me any of those, I'll be very grateful.

share|improve this question
1  
I just had to Google this to make sure you weren't misspelling Apple... you're good :-) –  Dynamic Dec 27 '12 at 17:30
5  
Have you read the original paper from Appel himself (here)? It is quite approachable and I expect it could help you with the conceptual approach. –  kmote Dec 27 '12 at 18:37

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.