|
Документ взят из кэша поисковой машины. Адрес
оригинального документа
: http://num-meth.srcc.msu.ru/english/zhurnal/tom_2002/art1_8.html
Дата изменения: Mon Dec 16 17:38:31 2002 Дата индексирования: Mon Oct 1 22:35:42 2012 Кодировка: |
|
"An algorithm for constructing the union, intersection and difference of
arbitrary polygons on the basis of triangulation with linear-time complexity
on average"
A.V. Skvortsov |
|
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.
|
| A.V. Skvortsov , e-mail: skv@csd.tsu.ru |