Geodesic
Computation of pair placement of geometric objects
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 5, pp. 809-816 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2000_40_5_a12,
     author = {V. N. Martynchik and N. N. Metel'skii and J.-M. Proth},
     title = {Computation of pair placement of geometric objects},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {809--816},
     year = {2000},
     volume = {40},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_5_a12/}
}
TY  - JOUR
AU  - V. N. Martynchik
AU  - N. N. Metel'skii
AU  - J.-M. Proth
TI  - Computation of pair placement of geometric objects
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2000
SP  - 809
EP  - 816
VL  - 40
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_5_a12/
LA  - ru
ID  - ZVMMF_2000_40_5_a12
ER  - 
%0 Journal Article
%A V. N. Martynchik
%A N. N. Metel'skii
%A J.-M. Proth
%T Computation of pair placement of geometric objects
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2000
%P 809-816
%V 40
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_5_a12/
%G ru
%F ZVMMF_2000_40_5_a12
V. N. Martynchik; N. N. Metel'skii; J.-M. Proth. Computation of pair placement of geometric objects. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 40 (2000) no. 5, pp. 809-816. http://geodesic.mathdoc.fr/item/ZVMMF_2000_40_5_a12/

[1] Metelskii N. N., Krikun B. C., Metod ierarkhicheskogo razmescheniya izoteticheskikh blokov, Preprint No 27(427), In-t matem. AN BSSR, Minsk, 1990

[2] Wang P. Y., “Two algorithms for constrained two-dimensional cutting stock problems”, Operat. Res., 31:3 (1983), 573–586 | DOI | Zbl

[3] Oliveira J. F., Ferreira J. S., “An improved version of Wang's algorithm for two-dimensional cutting problems”, Europa. J. Operat. Res., 44 (1990), 256–266 | DOI | MR | Zbl

[4] Leontev V. K., “Diskretnye ekstremalnye zadachi”, Itogi nauki i tekhn. Ser. teor. veroyatnostei. Matem. statistika. Teor. kibernetika, 16, Nauka, M., 1979, 39–101

[5] Papadimitriu X., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985 | MR

[6] Wood D., “An isothetic view of computational geometry”, Comput. Geometry, Elsevier, North Holland, 1985, 429–459 | MR

[7] Feinberg V. Z., Geometricheskie zadachi mashinnoi grafiki BIS, Radio i svyaz, M., 1987

[8] Preparata F., Sheimos M., Vychislitelnaya geometriya: Vvedenie, Mir, M., 1989 | MR | Zbl

[9] Akho A., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, M., 1979 | MR

[10] Naamad G. A., Hsu W. L., Lee D. T., “On maximum empty rectangle problem”, Appl. Disc. Math., 8 (1984), 267–277 | DOI | MR | Zbl

[11] Chazell B., Drysdale R. L., Lee D. T., “Computing the largest empty rectangle”, SIAM J. Comput., 15:1 (1986), 300–315 | DOI | MR | Zbl

[12] Metelskii H. H., Martynchik V. N., Osnovnye klassy obobschennoi vypuklosti dlya izoteticheskikh oblastei, Preprint No 14(464), In-t matem. AN BSSR, Minsk, 1991