Related papers: A Visualization Method of Four Dimensional Polytop…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
A data structure and toolkit are presented here that allow for the description and manipulation of mathematical models of three-manifolds and their interactive display from multiple viewpoints via the OpenGL 3D graphics package. The data…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
Aiming at applications to the scientific visualization of three dimensional simulations with time evolution, a keyboard based control method to specify rotations in four dimensions is proposed. It is known that four dimensional rotations…
4-dimensional $A_{4}$ polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group $W(A_{4})$ where the group elements and the vertices of the polytopes are represented by quaternions. Projection of an…
Higher-dimensional spaces are ubiquitous in applications of mathematics. Yet, as we live in a three-dimensional space, visualizing, say, a four-dimensional space is challenging. We introduce a novel method of interactive visualization of…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
The double orthogonal projection of the 4-space onto two mutually perpendicular 3-spaces is a method of visualization of four-dimensional objects in a three-dimensional space. We present an interactive animation of the stereographic…
For piecewise-linear maps the stable and unstable manifolds of hyperbolic periodic solutions are themselves piecewise-linear. Hence compact subsets of these manifolds can be represented using polytopes (i.e. polygons, in the case of…
Taking projections of high-dimensional data is a common analytical and visualisation technique in statistics for working with high-dimensional problems. Sectioning, or slicing, through high dimensions is less common, but can be useful for…
The space-like hypersurface of the Universe at the present cosmological time is a three-dimensional manifold. A non-trivial global topology of this space-like hypersurface would imply that the apparently observable universe (the sphere of…
Orbifolds are a modern mathematical concept that arises in the research of hyperbolic geometry with applications in computer graphics and visualization. In this paper, we make use of rooms with mirrors as the visual metaphor for orbifolds.…
We prove that each bounded polytope can be represented as a polynomial zonotope, which we refer to as the Z-representation of polytopes. Previous representations are the vertex representation (V-representation) and the halfspace…
We present a method to project a hypercube of arbitrary dimension on the plane, in such a way as to preserve, as well as possible, the distribution of distances between vertices. The method relies on a Montecarlo optimization procedure that…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
4-dimensional H4 polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group W(H4) where the group elements and the vertices of the polytopes are represented by quaternions. Projection of an arbitrary…
In this paper, we present Hi-D maps, a novel method for the visualization of multi-dimensional categorical data. Our work addresses the scarcity of techniques for visualizing a large number of data-dimensions in an effective and…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
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…
This note wants to explain how to obtain meaningful pictures of (possibly high-dimensional) convex polytopes, triangulated manifolds, and other objects from the realm of geometric combinatorics such as tight spans of finite metric spaces…