The Complexity of Many Cells in Arrangements of Planes and Related Problems.
H. Edelsbrunner; L.J. Guibas; M. Sharir
Discrete & computational geometry (1990)
- Volume: 5, Issue: 2, page 197-216
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topEdelsbrunner, H., Guibas, L.J., and Sharir, M.. "The Complexity of Many Cells in Arrangements of Planes and Related Problems.." Discrete & computational geometry 5.2 (1990): 197-216. <http://eudml.org/doc/131112>.
@article{Edelsbrunner1990,
author = {Edelsbrunner, H., Guibas, L.J., Sharir, M.},
journal = {Discrete & computational geometry},
keywords = {computational geometry; arrangements of planes; random sampling; -nets},
number = {2},
pages = {197-216},
title = {The Complexity of Many Cells in Arrangements of Planes and Related Problems.},
url = {http://eudml.org/doc/131112},
volume = {5},
year = {1990},
}
TY - JOUR
AU - Edelsbrunner, H.
AU - Guibas, L.J.
AU - Sharir, M.
TI - The Complexity of Many Cells in Arrangements of Planes and Related Problems.
JO - Discrete & computational geometry
PY - 1990
VL - 5
IS - 2
SP - 197
EP - 216
KW - computational geometry; arrangements of planes; random sampling; -nets
UR - http://eudml.org/doc/131112
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.