 | | Re: Hidden surface removal, and vertex order in part/primitive DAT files —Steve Bliss
|
| | | (...) This isn't automatic, but what if the program interrogates the user to pick a side which is facing outward? From that information, the program could then mark-up all adjacent sides. If the program ran out of sides, it could re-interrogate for (...) (25 years ago, 3-Oct-99, to lugnet.cad.dev)
|
| | | |
| | | | | Re: Hidden surface removal, and vertex order in part/primitive DAT files —Gary Williams
|
| | | | | Steve Bliss wrote in message <37f6c0d9.269680202@...et.com>... (...) Doh, you posted mere minutes before me and said the same thing. :) -Gary (25 years ago, 3-Oct-99, to lugnet.cad.dev)
|
| | | | | |
| | | | | Re: Hidden surface removal, and vertex order in part/primitive DAT files —Leonardo Zide
|
| | | | (...) Instead of asking the user, the program could first try to cast rays and then only if there are any faces left it asks the user. I've started writing my own converter and it worked correctly with the 'standard' bricks but had a few problems (...) (25 years ago, 3-Oct-99, to lugnet.cad.dev)
|
| | | | |
| | | | | | Re: Hidden surface removal, and vertex order in part/primitive DAT files —Jean-Pierre Paris
|
| | | | (...) you should consider that there are a lot of such groups of sides in one brick! Thus, the approach described by Leonardo is better: (...) Now, my main problem is: how can I find enough time to translate and check all the bricks! I guess my (...) (25 years ago, 3-Oct-99, to lugnet.cad.dev)
|
| | | | |
