相关论文: Pseudo-Triangulations - a Survey

Every simple quadrangulation of the sphere is generated by a graph called a pseudo-double wheel with two local expansions (Brinkmann et al. "Generation of simple quadrangulations of the sphere." Discrete Math., Vol. 305, No. 1-3, pp. 33-54,…

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…

The space-like hypersurface of the Universe at the present cosmological time is a three-dimensional manifold. A non-trivial global topology of this space-like hypersurface would imply that the apparently observable universe (the sphere of…

Tight triangulated manifolds are generalisations of neighborly triangulations of closed surfaces and are interesting objects in Combinatorial Topology. Tight triangulated manifolds are conjectured to be minimal. Except few, all the known…

Image triangulation, the practice of decomposing images into triangles, deliberately employs simplification to create an abstracted representation. While triangulating an image is a relatively simple process, difficulties arise when…

A pseudo-outcrop visualization is demonstrated for borehole and full-diameter rock core images to augment the ubiquitous unwrapped cylinder view and thereby to assist non-specialist interpreters. The pseudo-outcrop visualization is…

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

A pseudo-edge graph of a convex polyhedron K is a 3-connected embedded graph in K whose vertices coincide with those of K, whose edges are distance minimizing geodesics, and whose faces are convex. We construct a convex polyhedron K in…

The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…

A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…

Piecewise Euclidean structures (identified solid Euclidean polyhedra) on topological 3-dimensional manifolds and pseudo-manifolds are constructed so that they admit pseudo-foliations, a generalized type of foliation. The construction of…

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…

A pseudoline arrangement graph is a planar graph induced by an embedding of a (simple) pseudoline arrangement. We study the corresponding graph realization problem and properties of pseudoline arrangement graphs. In the first part, we give…

We introduce a linear algebraic object called a bidiagonal triad. A bidiagonal triad is a modification of the previously studied and similarly defined concept of bidiagonal triple. A bidiagonal triad and a bidiagonal triple both consist of…

Triangles are everywhere in the virtual world. The surface of nearly every graphical object is saved as a triangular mesh on a computer. Light effects and movements of virtual objects are computed on the basis of triangulations. Besides…

The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…

We give a procedure to construct (quasi-)trisection diagrams for closed (pseudo-)manifolds generated by colored tensor models without restrictions on the number of simplices in the triangulation, therefore generalizing previous works in the…