An algorithm for constructing the union, intersection and difference of
Numerical methods and programming, Tome 3 (2002) no. 1, pp. 116-123
Voir la notice de l'article provenant de la source Math-Net.Ru
The application of triangulation with constraints for constructing overlays
of arbitrary polygons is considered. A comparison of a new algorithm with
some others is given.
Mots-clés :
triangulation, data structure.
Keywords: computational geometry, computer graphycs, grid construction
Keywords: computational geometry, computer graphycs, grid construction
@article{VMP_2002_3_1_a7,
author = {A. V. Skvortsov},
title = {An algorithm for constructing the union, intersection and difference of},
journal = {Numerical methods and programming},
pages = {116--123},
publisher = {mathdoc},
volume = {3},
number = {1},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a7/}
}
A. V. Skvortsov. An algorithm for constructing the union, intersection and difference of. Numerical methods and programming, Tome 3 (2002) no. 1, pp. 116-123. http://geodesic.mathdoc.fr/item/VMP_2002_3_1_a7/