Related papers: A Visualization Method of Four Dimensional Polytop…
I present a way to visualize the concept of curved spacetime. The result is a curved surface with local coordinate systems (Minkowski Systems) living on it, giving the local directions of space and time. Relative to these systems, special…
Parallel coordinate plots (PCPs) are among the most useful techniques for the visualization and exploration of high-dimensional data spaces. They are especially useful for the representation of correlations among the dimensions, which…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
We investigate the problem of carving an $n$-face triangulated three-dimensional polytope using a tool to make cuts modelled by either a half-plane or sweeps from an infinite ray. In the case of half-planes cuts, we present a deterministic…
Cutting a polytope is a very natural way to produce new classes of interesting polytopes. Moreover, it has been very enlightening to explore which algebraic and combinatorial properties of the orignial polytope are hereditary to its…
A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…
We usually think of 2-dimensional manifolds as surfaces embedded in Euclidean 3-space. Since humans cannot visualise Euclidean spaces of higher dimensions, it appears to be impossible to give pictorial representations of higher-dimensional…
An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices.…
The paper is focused on the four-dimensional visualization of hypersurfaces represented by implicit equations without their parametrization. We describe a general method to find shadow boundaries in an arbitrary dimension and apply it in a…
Define a ``slice'' curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a…
Phase plotting is a useful way of visualising functions on complex space. We reinvent the method in the context of hyperbolic geometry, and we use it to plot functions on various representative surfaces for hyperbolic space, illustrating…
We study multiple tilings of 3-dimensional Euclidean space by a convex body. In a multiple tiling, a convex body $P$ is translated with a discrete multiset $\Lambda$ in such a way that each point of the space gets covered exactly $k$ times,…
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.…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…
Data visualizations summarize high-dimensional distributions in two or three dimensions. Dimensionality reduction entails a loss of information, and what is preserved differs between methods. Existing methods preserve the local or the…
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…
We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…
Complex systems are described with high-dimensional data that is hard to visualise. Inselberg's parallel coordinates are one representation technique for visualising high-dimensional data. Here we generalise Inselberg's approach, and use it…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…