An intrinsic characterization of foldings of euclidean space
Aperiodic Tiles.
Are Borromean Links So Rare?
B. Pivot theorems in n-space
Bemerkungen zu Determinanten-Theorie. Auszug aus Briefen an Herrn Baltzer.
Bemerkungen zur Geometrie des Dreiecks.
Calcul du rayon de la sphère inscrite dans le tétraèdre
Chiral Polytopes from Hyperbolic Honeycombs.
Classical -symbols and the tetrahedron.
Classification of dodecahedral space forms.
Coincidences of simplex centers and related facial structures.
Colouring polytopic partitions in
Colouring polytopic partitions in
We consider face-to-face partitions of bounded polytopes into convex polytopes in for arbitrary and examine their colourability. In particular, we prove that the chromatic number of any simplicial partition does not exceed . Partitions of polyhedra in into pentahedra and hexahedra are - and -colourable, respectively. We show that the above numbers are attainable, i.e., in general, they cannot be reduced.
Combinatorics, group theory and geometric models
Compact hyperbolic Coxeter -polytopes with facets.
Configuration spaces and limits of voronoi diagrams
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Countably convex sets
We investigate countably convex subsets of Banach spaces. A subset of a linear space is countably convex if it can be represented as a countable union of convex sets. A known sufficient condition for countable convexity of an arbitrary subset of a separable normed space is that it does not contain a semi-clique [9]. A semi-clique in a set S is a subset P ⊆ S so that for every x ∈ P and open neighborhood u of x there exists a finite set X ⊆ P ∩ u such that conv(X) ⊈ S. For closed sets this condition...
Counting all equilateral triangles in .
Counting Types of Rigid Frameworks.
Critical configurations of planar robot arms
It is known that a closed polygon P is a critical point of the oriented area function if and only if P is a cyclic polygon, that is, P can be inscribed in a circle. Moreover, there is a short formula for the Morse index. Going further in this direction, we extend these results to the case of open polygonal chains, or robot arms. We introduce the notion of the oriented area for an open polygonal chain, prove that critical points are exactly the cyclic configurations with antipodal endpoints and derive...