 | | Re: Some secrets of MLCad revealed ... —Damien Guichard
|
| | | (...) 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 (...) (21 years ago, 7-Jul-03, to lugnet.cad.mlcad)
|
| | | |
| | | | | Re: Some secrets of MLCad revealed ... —Larry Pieniazek
|
| | | | (...) <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. (21 years ago, 7-Jul-03, to lugnet.cad.mlcad)
|
| | | | |
| | | | | | Re: Some secrets of MLCad revealed ... —Damien Guichard
|
| | | | (...) 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 (...) (21 years ago, 7-Jul-03, to lugnet.cad.mlcad)
|
| | | | |
