Is there any plan to add symmetric differences for layers (from separate files)?
I have several very similar designs and file1 xor file2
would make it very simple to see whether there are any differences and if so where these differences are.
I would be willing to help but I have no experience with Java.
I do know C & Python well and can handle C++ but have very little time
for the next 1-2 months. I also know the GDS specs reasonably well
but I guess all that is needed are boundaries and paths after flattening
the hierachy.
If you tell me in which file(s) your Boolean AND algorithm is implemented
and how to produce flat gds-data, I would try to have a look. At least I
could suggest an algorithm or produce code which may not be Java but
perhaps close enough for an easy conversion.
- Till
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
I have collected some references related to algorithms for Boolean Mask Operations. You could see ( http://owlvision.sourceforge.net/references.html ) for details. Other suggestions are also welcome.
The code for performing Boolean operations is in the file "BooleanMaskOperation.java". You could try to compile the whole program by following the steps shown on the web page ( http://owlvision.sourceforge.net/maintainer.html ).
You could also contact me at iltseng@users.sourceforge.net
Cheers,
I-Lun
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:
Logged In: YES
user_id=1374381
Originator: NO
Dear Till Plewe,
This is an excellent suggestion and I think it is worth doing. However, I may need other people who can help me.
Regards,
I-Lun Tseng
Logged In: YES
user_id=540660
Originator: YES
Dear I-Lun Tseng,
I would be willing to help but I have no experience with Java.
I do know C & Python well and can handle C++ but have very little time
for the next 1-2 months. I also know the GDS specs reasonably well
but I guess all that is needed are boundaries and paths after flattening
the hierachy.
If you tell me in which file(s) your Boolean AND algorithm is implemented
and how to produce flat gds-data, I would try to have a look. At least I
could suggest an algorithm or produce code which may not be Java but
perhaps close enough for an easy conversion.
- Till
Logged In: YES
user_id=1374381
Originator: NO
Hello Till,
That is great. You are welcome to help.
I have collected some references related to algorithms for Boolean Mask Operations. You could see ( http://owlvision.sourceforge.net/references.html ) for details. Other suggestions are also welcome.
The code for performing Boolean operations is in the file "BooleanMaskOperation.java". You could try to compile the whole program by following the steps shown on the web page ( http://owlvision.sourceforge.net/maintainer.html ).
You could also contact me at iltseng@users.sourceforge.net
Cheers,
I-Lun