To LUGNET HomepageTo LUGNET News HomepageTo LUGNET Guide Homepage
 Help on Searching
 
Post new message to lugnet.cad.mlcadOpen lugnet.cad.mlcad in your NNTP NewsreaderTo LUGNET News Traffic PageSign In (Members)
 CAD / MLCad / 1727
1726  |  1728
Subject: 
Re: Some secrets of MLCad revealed ...
Newsgroups: 
lugnet.cad.mlcad
Date: 
Mon, 7 Jul 2003 01:03:41 GMT
Viewed: 
7242 times
  
In lugnet.cad.mlcad, Damien Guichard wrote:
> In lugnet.cad.mlcad, Michael Lachmann wrote:
> > "Damien Guichard" <damien.guichard@wanadoo.fr> schrieb im Newsbeitrag
> > news:HHKMxB.225G@lugnet.com...
> > <SNIP>
> > > Thanks Michael.
> > > So, at loading time, each added point has to be compared to all points in the
> > > point list. Does this impact the loading time of big parts or big models in a
> > > significant manner? Or is it only minor slowdown?
> > > 
> > > Regards,
> > > 
> > > Damien
> > 
> > So far I could find out, it doesn't effect loading much, I think it was
> > something about 10% less then without this feature. I must say, I haven't
> > tried using hash algorythms to find the point more quickly, but so far I
> > remember there is an average of arround 400 points in a file, and search for
> > an 12 byte value is not so hard ...
> > 
> > Michael
> 
> Ok, the practical figures relativize the problem for everyday use.
> Thanks Michael.
> 
> For the sake of sharing here is how I imagine a sorted point list.

<snip>


Cool! Should perform a lot faster on searching I would expect

400 points? That seems low to me. Most of my models have more than that many
elements! Even with shared vertices that seems low.



Message has 1 Reply:
  Re: Some secrets of MLCad revealed ...
 
(...) I guess points are shared only on a part basis, not on a model basis. So, 400 distinct points for a part is already a fair number. Thus I think the sorting technique I discuss is not candidate for implementation unless the ldraw library goes (...) (23 years ago, 7-Jul-03, to lugnet.cad.mlcad)

Message is in Reply To:
  Re: Some secrets of MLCad revealed ...
 
(...) Ok, the practical figures relativize the problem for everyday use. Thanks Michael. For the sake of sharing here is how I imagine a sorted point list. The sorted list is also implemented as an array, so points can be accessed by index for (...) (23 years ago, 7-Jul-03, to lugnet.cad.mlcad)

12 Messages in This Thread:



Entire Thread on One Page:
Nested:  All | Brief | Compact | Dots
Linear:  All | Brief | Compact

This Message and its Replies on One Page:
Nested:  All | Brief | Compact | Dots
Linear:  All | Brief | Compact
    

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