Construction of e-Nets.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 427-448.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : approximate partitioning of intersections, computational complexity of -nets, cutting line arrangements, combinatorial geometry
@article{DCG_1990__5_2_131131,
     author = {J. Matousek},
     title = {Construction of {e-Nets.}},
     journal = {Discrete & computational geometry},
     pages = {427--448},
     publisher = {mathdoc},
     volume = {5},
     number = {2},
     year = {1990},
     zbl = {0701.68040},
     url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131131/}
}
TY  - JOUR
AU  - J. Matousek
TI  - Construction of e-Nets.
JO  - Discrete & computational geometry
PY  - 1990
SP  - 427
EP  - 448
VL  - 5
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131131/
ID  - DCG_1990__5_2_131131
ER  - 
%0 Journal Article
%A J. Matousek
%T Construction of e-Nets.
%J Discrete & computational geometry
%D 1990
%P 427-448
%V 5
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131131/
%F DCG_1990__5_2_131131
J. Matousek. Construction of e-Nets.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 427-448. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131131/