The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 161-196
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
computational geometry, conquer, arrangements of segments, arrangement of n lines, -nets, random sampling
@article{DCG_1990__5_2_131111,
author = {H. Edelsbrunner and L.J. Guibas and M. Sharir},
title = {The {Complexity} and {Construction} of {Many} {Faces} in {Arrangements} of {Lines} and of {Segments.}},
journal = {Discrete & computational geometry},
pages = {161--196},
year = {1990},
volume = {5},
number = {2},
zbl = {0691.68035},
url = {http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131111/}
}
TY - JOUR AU - H. Edelsbrunner AU - L.J. Guibas AU - M. Sharir TI - The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments. JO - Discrete & computational geometry PY - 1990 SP - 161 EP - 196 VL - 5 IS - 2 UR - http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131111/ ID - DCG_1990__5_2_131111 ER -
%0 Journal Article %A H. Edelsbrunner %A L.J. Guibas %A M. Sharir %T The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments. %J Discrete & computational geometry %D 1990 %P 161-196 %V 5 %N 2 %U http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131111/ %F DCG_1990__5_2_131111
H. Edelsbrunner; L.J. Guibas; M. Sharir. The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.. Discrete & computational geometry, Tome 5 (1990) no. 2, pp. 161-196. http://geodesic.mathdoc.fr/item/DCG_1990__5_2_131111/