Subject:
|
Re: Part Authors: opinions sought on T-Junctions
|
Newsgroups:
|
lugnet.cad.dat.parts
|
Date:
|
Tue, 6 Mar 2007 21:22:29 GMT
|
Viewed:
|
5096 times
|
| |
|
|
In lugnet.cad.dat.parts, Don Heyse wrote:
| |
Well... Technically it is true. The rendering program ought to be
able to scan all the points in each part and look for intersections
with every edge in the part. Then break up the offensive T-joins
automagically and render it perfectly. That’s only O(n^2) or so.
Blink of an eye on today’s processors.
Doesn’t ldview do this already? I’m sure txt2dat does. Try to be
a little more up to date, will ya? ;^)
|
Well actually what txt2dat does is a slightly different problem - it has a few
simple closed loops and has to triangulate the complex polygons bounded by them
(it uses the excellent triangle
library to do that).
Renderers on the other hand would have to check every edge for intersections,
and perform rudimentary triangulation when an intersection is found. And only to
correct a small problem on a minimum of parts - that’s a fair bit of extra
processing for not much gain, when the problem COULD be corrected at the
source...
I do however agree that it should not be a requirement for parts, but rather a
suggestion for authors. Maybe it could also be a suggestion for renderer
authors, to provide the extra processing as a switchable option.
ROSCO
|
|
Message is in Reply To:
 | | Re: Part Authors: opinions sought on T-Junctions
|
| (...) Well... Technically it is true. The rendering program ought to be able to scan all the points in each part and look for intersections with every edge in the part. Then break up the offensive T-joins automagically and render it perfectly. (...) (17 years ago, 6-Mar-07, to lugnet.cad.dat.parts, FTX)
|
22 Messages in This Thread:
 
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
