To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.cad.dat.partsOpen lugnet.cad.dat.parts in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 CAD / LDraw Files / Parts / 6106
6105  |  6107
Subject: 
Re: Part Authors: opinions sought on T-Junctions
Newsgroups: 
lugnet.cad.dat.parts
Date: 
Tue, 6 Mar 2007 22:01:56 GMT
Viewed: 
5765 times
  
In lugnet.cad.dat.parts, Travis Cobbs wrote:
   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.

OK, I stand corrected. Technically a program can fix things at load time.

However, you might be surprised at how long it takes. It’s “only” O(n^2), but each iteration is slow. You have to search the current line segment against all other line segments in the part, and find any partial overlaps. And n in this case is the total number of points in the entire part, not just the current file, since it’s perfectly valid for things to blend across sub-part/primitive boundaries (look at where the studs meet the main body of the 2x2 round brick).

   Doesn’t ldview do this already? I’m sure txt2dat does. Try to be a little more up to date, will ya? ;^)

Assuming txt2dat does this, bear in mind that it doesn’t really have to be all that fast, since it gets run once and the generated data then gets used as often as needed....

blah, blah, blah, snip

Oops, I was trying to be all ironical in a geeky math sorta way. But apparently I failed. Guess I shoulda used more winkies... Do people still use winkies? Or have they gone obsolete like ASCII art?

Anyhow, sorry about that. Have fun,

Don



Message is in Reply To:
  Re: Part Authors: opinions sought on T-Junctions
 
(...) OK, I stand corrected. Technically a program can fix things a load time. However, you might be surprised at how long it takes. It's "only" O(n^2), but each iteration is slow. You have to search the current line segment against all other line (...) (18 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
    

Custom Search

©2005 LUGNET. All rights reserved. - hosted by steinbruch.info GbR