Hi Nils,
If you get around the LDPC template projection problem... I get another idea to help the creation of templates from a flat surface and a matching formed one (see http://forums.ldraw.org/thread-21905-pos...l#pid23825): a topological surface sorter. The user would indicate the first A and second B elements (adjacent), then an algorithm reaching all elements depending on their connection would be applied to sort all elements of the surface (Could be a sort on "topological distance" as shown in the attached image). Once this is done it's a simple task to create a template from flat and formed surfaces, at least a basic one. A more sophisticated one would also reassemble all coplanar elements in the formed file (and matching ones in flat file) to minimize pattern boundaries.
If you get around the LDPC template projection problem... I get another idea to help the creation of templates from a flat surface and a matching formed one (see http://forums.ldraw.org/thread-21905-pos...l#pid23825): a topological surface sorter. The user would indicate the first A and second B elements (adjacent), then an algorithm reaching all elements depending on their connection would be applied to sort all elements of the surface (Could be a sort on "topological distance" as shown in the attached image). Once this is done it's a simple task to create a template from flat and formed surfaces, at least a basic one. A more sophisticated one would also reassemble all coplanar elements in the formed file (and matching ones in flat file) to minimize pattern boundaries.