Related papers: Computer geometry: Rep-tiles with a hole
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…
We propose a method to recover the structure of a compound object from multiple silhouettes. Structure is expressed as a collection of 3D primitives chosen from a pre-defined library, each with an associated pose. This has several…
Here we show how reversible computation processes, like Margolus diffusion, can be envisioned as physical turning operations on a 2-dimensional rigid surface that is cut by a regular pattern of intersecting circles. We then briefly explore…
A fundamental question in computer vision is whether a set of point pairs is the image of a scene that lies in front of two cameras. Such a scene and the cameras together are known as a chiral reconstruction of the point pairs. In this…
Discrete cubical homology arose as the homology theory associated with discrete cubical homotopy theory. Despite the combinatorial nature of this homology, its computation has posed a significant challenge to the researchers in the field.…
The solution of the cubic equation has a century-long history; however, the usual presentation is geared towards applications in algebra and is somewhat inconvenient to use in optimization where frequently the main interest lies in real…
We analyze the facial structures of the convex set consisting of all two qubit separable states. One of faces is a four dimensional convex body generated by the trigonometric moment curve arising from polyhedral combinatorics. Another one…
In this note we prove that any monohedral tiling of the closed circular unit disc with $k \leq 3$ topological discs as tiles has a $k$-fold rotational symmetry. This result yields the first nontrivial estimate about the minimum number of…
We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.
A famous configuration of 27 lines on a non-singular cubic surface in $\mathbb P^3$ contains remarkable subconfigurations, and in particular the ones formed by six pairwise disjoint lines. We study such six-line configurations in the case…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
Given an undirected graph $G = (V,E)$, the cut polytope $\mathrm{CUT}(G)$ is defined as the convex hull of the incidence vectors of all cuts in $G$. The 1-skeleton of $\mathrm{CUT}(G)$ is a graph whose vertex set is the vertex set of the…
An efficient way to get implicit equations of conics on five points and quadrics on nine, using pencils of conics and quadrics, is revealed. Parallel axis right cones intersect on a conic. An example, to show how to place five coplanar…
A perfect cuboid is a rectangular parallelepiped with integer edges, integer face diagonals, and integer space diagonal. Such cuboids have not yet been found, but nor has their existence been disproved. Perfect cuboids are described by a…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure…
This paper provides an in-depth analysis of how computational algebraic geometry can be used to deal with the problem of counting and classifying $r\times s$ partial Latin rectangles based on $n$ symbols of a given size, shape, type or…
We consider the one-person game of peg solitaire played on a computer. Two popular board shapes are the 33-hole cross-shaped board, and the 15-hole triangle board---we use them as examples throughout. The basic game begins from a full board…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual structure: a collection of oriented loops which run in each…