A linear-time construction of Reuleaux polygons.
A Polynomial Solution for the Potato-peeling Problem.
An Algorithm for Reconstructing Convex Bodies from Their Projections.
An Interactive Creation of Polyhedra Stellations with Various Symmetries
Approximating the Volume of Convex Bodies.
Diameter Partitioning.
Enumeration of integral tetrahedra.
Generalized Delaunay Triangulation for Planar Graphs.
Nonexistence of a weakly neighbourly polyhedral map of type .
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
Penny-Packing and Two-Dimensional Codes.
Polygon placement under translation and rotation
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.
Triangulation automatique d’un polyèdre en dimension