No CrossRef data available.
Article contents
On intersection probabilities of four lines inside a planar convex domain
Published online by Cambridge University Press: 07 December 2022
Abstract
Let
$n\geq 2$
random lines intersect a planar convex domain D. Consider the probabilities
$p_{nk}$
,
$k=0,1, \ldots, {n(n-1)}/{2}$
that the lines produce exactly k intersection points inside D. The objective is finding
$p_{nk}$
through geometric invariants of D. Using Ambartzumian’s combinatorial algorithm, the known results are instantly reestablished for
$n=2, 3$
. When
$n=4$
, these probabilities are expressed by new invariants of D. When D is a disc of radius r, the simplest forms of all invariants are found. The exact values of
$p_{3k}$
and
$p_{4k}$
are established.
Keywords
- Type
- Original Article
- Information
- Copyright
- © The Author(s), 2022. Published by Cambridge University Press on behalf of Applied Probability Trust
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230503050017930-0857:S0021900222000602:S0021900222000602_inline363.png?pub-status=live)
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20230503050017930-0857:S0021900222000602:S0021900222000602_inline364.png?pub-status=live)