相关论文: Closed-form Quadrangulation of N-Sided Patches

Given a closed oriented PL four-manifold $X$ and a closed surface $B$ embedded in $X$ with isolated cone singularities, we give a formula for the signature of an irregular dihedral cover of $X$ branched along $B$. For $X$ simply-connected,…

We analyze surface patches with a corner that is rounded in the sense that the partial derivatives at that point are antiparallel. Sufficient conditions for $G^1$ smoothness are given, which, up to a certain degenerate case, are also…

A new parametric surface representation is proposed that interpolates the vertices of a given closed mesh of arbitrary topology. Smoothly connecting quadrilateral patches are created by blending local, multi-sided quadratic interpolants. In…

We analyze the computational complexity of several new variants of edge-matching puzzles. First we analyze inequality (instead of equality) constraints between adjacent tiles, proving the problem NP-complete for strict inequalities but…

We examine the conditions under which a signed graph contains an edge or a vertex that is contained in a unique negative circle or a unique positive circle. For an edge in a unique signed circle, the positive and negative case require the…

We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…

We show that, given $d \geq 4$ and two closed connected oriented PL $4$-manifolds $M$ and $N$ such that $N$ has a handle decomposition with no $1$- and $3$-handles, there exists a $d$-fold simple branched covering $p \colon M \darrow{d} N$…

We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…

A zigzag in a map (a $2$-cell embedding of a connected graph in a connected closed $2$-dimensional surface) is a cyclic sequence of edges satisfying the following conditions: 1) any two consecutive edges lie on the same face and have a…

This paper deals with the existence of $N$ vortex patches located at the vertex of a regular polygon with $N$ sides that rotate around the center of the polygon at a constant angular velocity. That is done for Euler and (SQG)$_\beta$…

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…

We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again…

We show that any combinatorial triangulation on n vertices can be transformed into a 4-connected one using at most floor((3n - 9)/5) edge flips. We also give an example of an infinite family of triangulations that requires this many flips…

Given a collection of N rectangles such that the side ratio of each one is a quadratic irrationality, we find all rectangles which can be tiled by rectangles similar to one of the given ones. It means that each possible shape can be used…

An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right,…

All the work made so far on edge-covering a graph by cliques focus on finding the minimum number of cliques that cover the graph. On this paper, we fix the number of cliques that cover a graph by the same number of vertices that the graph…

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

We address the unsolved problem of unfolding prismatoids in a new context, viewing a "topless prismatoid" as a convex patch---a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural…

We present structures comprised of identical convex polyhedra which are interlocked geometrically. These sets cannot be disassembled by removing individual polyhedra by translations and/or rotations. The shapes that permit interlocking…