The investigated mesh optimization problem C(N; n) for surface approximation, which is NP-hard, is to minimize the global error between a digital surface and its approximating mesh surface by e ciently locating a limited number n of grid points which are a subset of the original N sample points. Thi
An algorithm for evolutionary surfaces
β Scribed by G. Dziuk
- Publisher
- Springer-Verlag
- Year
- 1990
- Tongue
- English
- Weight
- 463 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We used a genetic algorithm to fit a set of energy differences obtained by neglect-of-diatomic-differential-overlap (NDDO) molecular orbital theory to reference ab initio data, yielding a set of specific reaction parameters (SRP) for the reaction CI + CH 4. Only a small number ab initio points along
A new approach to surface-surface intersection problems is proposed. Surface-surface intersection forms a fundamental function in computational geometry and geometric modeling. A geometric modeler needs to be equipped with a robust and accurate SSI algorithm to deal with a wide range of complex mode