TY - GEN
T1 - Combinatorial complexity bounds for arrangements of curves and surfaces
AU - Clarkson, Kenneth L.
AU - Edelsbrunner, Herbert
AU - Guibas, Leonidas J.
AU - Sharir, Micha
AU - Welzl, Emo
PY - 1988
Y1 - 1988
N2 - The authors study both the incidence counting and the many-faces problem for various kinds of curves, including lines, pseudolines, unit circles, general circles, and pseudocircles. They also extend the analysis to three dimensions, where they concentrate on the case of spheres, which is relevant for the three-dimensional unit-distance problem. They obtain upper bounds for certain quantities. The authors believe that the techniques they use are of independent interest.
AB - The authors study both the incidence counting and the many-faces problem for various kinds of curves, including lines, pseudolines, unit circles, general circles, and pseudocircles. They also extend the analysis to three dimensions, where they concentrate on the case of spheres, which is relevant for the three-dimensional unit-distance problem. They obtain upper bounds for certain quantities. The authors believe that the techniques they use are of independent interest.
UR - http://www.scopus.com/inward/record.url?scp=0024141509&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1988.21973
DO - 10.1109/sfcs.1988.21973
M3 - פרסום בספר כנס
AN - SCOPUS:0024141509
SN - 0818608773
SN - 9780818608773
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 568
EP - 579
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
ER -