Subject:
|
Level B Simplification - LDraw Boxer
|
Newsgroups:
|
lugnet.cad.ray
|
Date:
|
Tue, 11 Feb 2003 04:19:23 GMT
|
Viewed:
|
1460 times
|
| |
|
|
Level B Simplification: Replace with plain boxes only those parts that has
all its studs and inside totally hidden by other parts.
I've just finished a program that scans for all non-transparent parts that
has their studs and bottoms covered with other non-transparent parts. Then
it replaces them with plain boxes, relieving POV from rendering studs and
tubes that can't possibly be seen anyway.
Trying this program on the Datsville Town Hall, it automatically replaced
1001 parts with boxes!
Two notes: Town Hall took more than half to go through on my AMD P1100, so
don't panic if your PC gets busy for a while.
And: Don't use this program on the only original copy of your masterpiece, I
leave no guarantees...
http://home.swipnet.se/simlego/ldraw/ldboxer/p_ld1.zip (170 kb)
You'll also need these files copied into %LDRAWDIR%\Parts\B\
http://home.swipnet.se/simlego/ldraw/ldboxer/b.zip (32 kb)
|
|
Message has 4 Replies:
 | | Re: Level B Simplification - LDraw Boxer
|
| (...) Just so you don't interpret the paucity of responses to indicate a lack of interest, let me say for the record that this sounds like a fantastic utility! I haven't had time to download and install it yet, but I will try to do so when I get (...) (21 years ago, 12-Feb-03, to lugnet.cad.ray)
| | | Re: Level B Simplification - LDraw Boxer
|
| (...) Clever idea. I don't know if you are interest by optimization. I suppose a brick is (xmin,xmax,ymin,ymax...min,zmax). I guess the most efficient data structure is octree. Octrees can be implmented as binary trees. On the first level you sort (...) (21 years ago, 12-Feb-03, to lugnet.cad.ray)
|
8 Messages in This Thread:
 
 
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
