Related papers: Hitting probabilities for random convex bodies and…
Santal\'o calculated the measures for all positions of a moving line segment in which it lies inside a fixed circle and intersects this circle in one or two points. From these measures he concluded hitting probabilities for a line segment…
For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…
Motivated by a problem on the 67th William Lowell Putnam Mathematical Competition, we will summarize three different solutions found on a website. This Putman problem is a special case of Sylvester's four point problem! Suppose four points…
In this paper, we derive the exact formula for the probability that three randomly and uniformly selected points from the interior of the unit cube form vertices of an obtuse triangle.
In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.
In the projective plane over a finite field of characteristic not equal to 2, we compute the probability that a randomly selected pair of distinct conics $(\mathscr{A},\mathscr{B})$, with $\mathscr{A}$ smooth or singular and $\mathscr{B}$…
Generalizing the well-known relations on characteristic functions on a plane to the case of a one-dimensional regular surface (curve) with compact support, we establish implicit equations for these functions. Introducing an approximation,…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
We use a probabilistic interpretation of solid angles to generalize the well-known fact that the inner angles of a triangle sum to 180 degrees. For the 3-dimensional case, we show that the sum of the solid inner vertex angles of a…
We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…
We use the idea of the broken stick problem (which goes back to Poincare) and calculate the corresponding probabilities for the cases in which the three broken part are: the medians in a triangle, the altitudes, radii of excircles, angle…
In this paper, we obtain the counting formulaes of convex pentagons and convex hexagons, respectively, in an $n$-triangular net by solving the corresponding recursive formulaes.
Let ${\mathbf P}^2$ denote the projective plane over a finite field ${\mathbb F}_q$. A pair of nonsingular conics $({\mathcal A}, {\mathcal B})$ in the plane is said to satisfy the Poncelet triangle condition if, considered as conics in…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…
What is the probability that a random triangle is acute? We explore this old question from a modern viewpoint, taking into account linear algebra, shape theory, numerical analysis, random matrix theory, the Hopf fibration, and much much…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…