Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Abellanas M., Garcia J., Hernandez G. et al., “Updating polygonizations”, Comput. Graphics Forum, 12:3 (1993), 143–152 | DOI
[2] Abellanas M., Hurtado F., Ramos P., “Redrawing a graph within a geometric tolerance”, Graph Drawing, Lect. Notes Computer Sci., Springer, Berlin–Heidelberg, 1995 | MR
[3] Preparata F., Sheimos M., Vychislitelnaya geometriya, Mir, M., 1989 | MR | Zbl
[4] Aurenhammer F., “Voronoi diagram — a survey of a fundamental geometric data structure”, ACM Computing Surveys, 23:3 (1991), 345–405 | DOI
[5] Gordeev E. N., “Diagramma Voronogo: obzor”, Raspoznavanie. Klassifikatsiya. Prognoz, Nauka, M., 1991, 41–66 | MR
[6] Klark F., Optimizatsiya i negladkii analiz, Nauka, M., 1988 | MR | Zbl
[7] Makeev V. V., “Stepen otobrazheniya v nekotorykh zadachakh kombinatornoi geometrii”, Geometrich. sb., Kharkov, 1987, 62–66 | Zbl
[8] Voronoi G. F., “Recherches sur les paralleloédres primitifs”, Crelle J., 134 (1908), 198–287 ; 136 (1909), 67–179 | DOI | Zbl | DOI
[9] Burnikel C., Mehlhorn K., Schirra S., “On degeneracy in geometric computations”, Proc. 5th Internat. Conf. on Discrete Opt., Arlington, 1994, 16–23 | MR | Zbl
[10] Leontev V. K., Gordeev E. N., “Kachestvennoe issledovanie traektornykh zadach”, Kibernetika, 1985, no. 5, 81–90
[11] Delone B. N., “Geometriya polozhitelnykh kvadratichnykh form. I; II”, Uspekhi matem. nauk, 1937, no. 3, 16–62 ; 1938, No 4, 102–164