相关论文: An Analysis of Triangulation in Geometrically Nois…
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…
This paper explores and proves the one-seventh area triangle using a purely algebraic approach as opposed to a geometric one. A triangle set purely in the complex plane is used so that we can utilise features of the complex number system to…
Conway and Lagarias showed that certain roughly triangular regions in the hexagonal grid cannot be tiled by shapes Thurston later dubbed tribones. Here we study a two-parameter family of roughly hexagonal regions in the hexagonal grid and…
Let $\Poly$ be a simple polygon with $n$ vertices. The \emph{dual graph} $\triang^*$ of a triangulation~$\triang$ of~$\Poly$ is the graph whose vertices correspond to the bounded faces of $\triang$ and whose edges connect those faces…
Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding {\em rectangular layouts} is a key problem. We…
We show that if a closed, oriented 3-manifold M is promised to be homeomorphic to a lens space L(n,k) with n and k unknown, then we can compute both n and k in polynomial time in the size of the triangulation of M. The tricky part is the…
In three-dimensional computational topology, the theory of normal surfaces is a tool of great theoretical and practical significance. Although this theory typically leads to exponential time algorithms, very little is known about how these…
We investigate algorithms with predictions in computational geometry, specifically focusing on the basic problem of computing 2D Delaunay triangulations. Given a set $P$ of $n$ points in the plane and a triangulation $G$ that serves as a…
In this paper we give an algorithm to recognize triangulable locally nilpotent derivations in dimension three. In case the given derivation is triangulable, our method produces a coordinate system in which it exhibits a triangular form.
Products of simplices, called simplotopes, and their triangulations arise naturally in algorithmic applications in game theory and optimization. We develop techniques to derive lower bounds for the size of simplicial covers and…
We present a new and simple randomized algorithm for constructing the Delaunay triangulation using nearest neighbor graphs for point location. Under suitable assumptions, it runs in linear expected time for points in the plane with…
We present a method that gives highly accurate electrostatic potentials for systems where we have periodic boundary conditions in two spatial directions but free boundary conditions in the third direction. These boundary conditions are…
We consider some planar triangular maps. These maps preserve certain fibration of the plane. We assume that there exists an invariant attracting fiber and we study the limit dynamics of those points in the basin of attraction of this…
We discuss different approaches for the enumeration of triangulated surfaces. In particular, we enumerate all triangulated surfaces with 9 and 10 vertices. We also show how geometric realizations of orientable surfaces with few vertices can…
We consider triangulations of closed $2$-dimensional (not necessarily orientable) surfaces. Any minimal set of zigzags that double covers the set of edges provides a $z$-orientation of the triangulation. We introduce Markov chains of…
Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…
Based on the geometric {\it Triangle Algorithm} for testing membership of a point in a convex set, we present a novel iterative algorithm for testing the solvability of a real linear system $Ax=b$, where $A$ is an $m \times n$ matrix of…
An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…
Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…