Smile: a computer program for partitioning of programmed logic arrays
β Scribed by Giovanni De Micheli; Mauro Santomauro
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 756 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0010-4485
No coin nor oath required. For personal study only.
β¦ Synopsis
A geometric algorithm for performing bending operations on polyhedral objects is described. The hypotheses, conditions and model of the bending process are defined, and then the mathematical model of bending is developed for each element of the boundary representation of a polyhedron. The algorithm has applications as a new means of generating geometric models and, in the CA D/CAM field, for simulating bending processes used to manufacture parts. The algorithm has been implemented and examples are given of objects transformed by the bending operation.
π SIMILAR VOLUMES
The classical problem of constructing formal integrals for a Hamiltonian ofharmonic oscillators coupled by polynomial
Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a numb