Tangent segments in Minkowski planes.
Testing of convex polyhedron visibility by means of graphs
This paper follows the article by V. Medek which solves the problem of finding the boundary of a convex polyhedron in both parallel and central projections. The aim is to give a method which yields a simple algorithm for the automation of an arbitrary graphic projection of a convex polyhedron. Section 1 of this paper recalls some necessary concepts from the graph theory. In Section 2 graphs are applied to determine visibility of a convex polyhedron.
The Complexity of Cutting Complexes.
The densest packing of 12 congruent circles in a circle.
The Equichordal Point Problem.
The generalized Favard problem.
The inverse semigroup of partial symmetries of a convex polygon.
The Limit Shape of Convex Lattice Polygons.
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.
The Maximum Size of a Convex Polygon in a Restricted Set of Points in the Plane.
The Orthogonal Convex Skull Problem.
The pentagram map.
The pentagram map is recurrent.
The sum of two plane convex C... sets is not always C...
The Worm Problem of Leo Moser.
Triangulation automatique d’un polyèdre en dimension