Related papers: 3D Polyominoes inscribed in a rectangular prism
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…
A method for displaying volumetric images, which exploits our binocular vision and does not require eyewear, is discussed. The display can be rendered as a matrix of pivoting micromirrors irradiated by a light beam; each micromirror focuses…
An alternative generating function is proposed to enumerate row-convex polyominoes without internal holes on a discrete grid. The approach is based on integer partitions of the total area, where each partition corresponds to a sequence of…
One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…
For a graph embedded into a surface, we relate many combinatorial parameters of the cycle matroid of the graph and the bond matroid of the dual graph with the topological parameters of the embedding. This will give an expression of the…
Hexagonal polyominoes are polyominoes on the honeycomb lattice. We enumerate the symmetry classes of convex hexagonal polyominoes. Here convexity is to be understood as convexity along the three main column directions. We deduce the…
We prove the existence of a one parameter family of minimal embedded hypersurfaces in $R^{n+1}$, for $n \geq 3$, which generalize the well known 2 dimensional "Riemann minimal surfaces". The hypersurfaces we obtain are complete, embedded,…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
3D promises a new dimension in composing systems by aggregating chips. Literally. While the most common uses are still tightly connected with its early forms as a packaging technology, new application domains have been emerging. As the…
Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…
A combinatorial block design $D$ is called $3$-pyramidal if there exists a subgroup $G$ of $\mbox{Aut}(D)$ fixing $3$ points and acting regularly on the other points. If this happens, we say that the design is $3$-pyramidal under $G$. In…
We propose single-step additive fabrication of graded-index optical elements by introducing the light exposure as the additional dimension to three-dimensional (3D) laser writing, hence (3+1)D writing. We use a commercial printer and…
We define the (dynamical) core of a topological polynomial (and the associated lamination). This notion extends that of the core of a unimodal interval map. Two explicit descriptions of the core are given: one related to periodic objects…
A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…
We construct new families of direct serendipity and direct mixed finite elements on general planer convex polygons that are $H^1$ and $H(div)$ conforming, respectively, and possess optimal order of accuracy for any order. They have a…
A (convex) polytope $P$ is said to be $2$-level if for every direction of hyperplanes which is facet-defining for $P$, the vertices of $P$ can be covered with two hyperplanes of that direction. The study of these polytopes is motivated by…
Planar graphs are the graphs with Dushnik-Miller dimension at most three (W. Schnyder, Planar graphs and poset dimension, Order 5, 323-343, 1989). Consider the intersection graph of interior disjoint axis parallel rectangles in the plane.…