论文信息 - An Improved Bound for Joints in Arrangements of Lines in Space

An Improved Bound for Joints in Arrangements of Lines in Space

Abstract Let L be a set of n lines in space. A joint of L is a point in R3 where at least three non-coplanar lines meet. We show that the number of joints of L is O(n112/69 log6/23n)=O(n1.6232), improving the previous bound O(n1.643) of Sharir.

Micha Sharir | Sharona Feldman

[1] Micha Sharir,et al. Incidences between points and circles in three and higher dimensions , 2002, SCG '02.

[2] Leonidas J. Guibas,et al. Lines in space: Combinatorics and algorithms , 2005, Algorithmica.

[3] Leonidas J. Guibas,et al. Counting and cutting cycles of lines and rods in space , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[4] Micha Sharir,et al. On the zone of a surface in a hyperplane arrangement , 1993, Discret. Comput. Geom..

[5] Micha Sharir,et al. Point–Line Incidences in Space , 2004, Combinatorics, Probability and Computing.

[6] Alexandra Solan,et al. Cutting cylces of rods in space , 1998, SCG '98.

[7] Sariel Har-Peled. Constructing cuttings in theory and practice , 1998, SCG '98.

[8] János Pach,et al. Combinatorial Geometry , 2012 .

[9] Micha Sharir. On Joints in Arrangements of Lines in Space and Related Problems , 1994, J. Comb. Theory, Ser. A.

[10] Endre Szemerédi,et al. Extremal problems in discrete geometry , 1983, Comb..

[11] Sariel Har-Peled,et al. Constructing Planar Cuttings in Theory and Practice , 2000, SIAM J. Comput..

[12] Micha Sharir,et al. Cutting Triangular Cycles of Lines in Space , 2003, STOC '03.

[13] Bernard Chazelle,et al. A deterministic view of random sampling and its use in geometry , 1990, Comb..

[14] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..