AbstractLet T be a triangulation of a closed topological cube Q, and let V be the set of vertices of T. Further assume that the triangulation satisfies a technical condition which we call the triple intersection property (see Definition 3.6). Then there is an essentially unique tiling C={Cv:v∈V} of a rectangular parallelepiped R by cubes, such that for every edge (u,v) of T the corresponding cubes Cv, Cu have nonempty intersection, and such that the vertices corresponding to the cubes at the corners of R are at the corners of Q. Moreover, the sizes of the cubes are obtained as a solution of a variational problem which is a discrete version of the notion of extremal length in R3
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
AbstractLet T be a triangulation of a closed topological cube Q, and let V be the set of vertices of...
Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving sq...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
AbstractWe present an algorithm that efficiently counts all intersecting triples among a collection ...
We examine tilings of the plane (plane tilings) and of 3-space that have the neighborhood property (...
ABSTRACT We present an algorithm that efficiently counts all intersecting triples among a collection...
Let K be a polygonal knot. A triple abc is a trisecant of K if a, b and c are points in K, no two of...
Introduction Tessellating a surface into triangular facets for manipulation or visualization purpo...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
A three-dimensional domain with piecewise linear boundary elements can be represented as a piecewise...
In 1970 P. Monsky showed that a square cannot be triangulated into an odd number of triangles of equ...
AbstractAn asteroidal triple is an independent set of vertices such that each pair is joined by a pa...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...
AbstractLet T be a triangulation of a closed topological cube Q, and let V be the set of vertices of...
Extremal length is a conformal invariant that transfers naturally to the discrete setting, giving sq...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose v...
AbstractWe present an algorithm that efficiently counts all intersecting triples among a collection ...
We examine tilings of the plane (plane tilings) and of 3-space that have the neighborhood property (...
ABSTRACT We present an algorithm that efficiently counts all intersecting triples among a collection...
Let K be a polygonal knot. A triple abc is a trisecant of K if a, b and c are points in K, no two of...
Introduction Tessellating a surface into triangular facets for manipulation or visualization purpo...
The intersection graph of a set system S is a graph on the vertex set S, in which two vertices are c...
A three-dimensional domain with piecewise linear boundary elements can be represented as a piecewise...
In 1970 P. Monsky showed that a square cannot be triangulated into an odd number of triangles of equ...
AbstractAn asteroidal triple is an independent set of vertices such that each pair is joined by a pa...
summary:We give an example of a set $P$ of $3n$ points in $\Bbb R 3$ such that, for any partition of...
Triangulations of 3-dimensional polyhedron are partitions of the polyhedron with tetrahedra in a fac...
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices a...