The Thesis algorithm uses partial-differential edge operators and a grammatical structure to generate and avoid expanding the Matching Polynomial. To run the algorithm efficiently, the vertexes of fullerene graphs C60-100 were sorted into three-dimensional sectors.
Environmentally safe manufacturing includes recycling. In particular, it includes reuse of the objects (whose shapes are no more needed) by cutting and pasting them into the necessary shapes. From the geometric viewpoint, the problem of how to cut and paste can be expressed in terms of equidecomposability of polygons and polyhedra. In (Kosheleva et al 1994)… (More)