Related papers: 3-Colorable Delaunay Triangulations
We study a three-dimensional analogue to the well-known graph visualization approach known as arc diagrams. We provide several algorithms that achieve good angular resolution for 3D arc diagrams, even for cases when the arcs must project to…
Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…
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.
We compute the convex hull in $\mathbb{C}^2$ of an arbitrary finite subgroup of ${\mathbb{C}^*}^2$. The combinatorics are dictated by continued fractions in a natural way. This reproves a theorem of Smilansky, with a slightly stronger…
Given a grayscale photograph as input, this paper attacks the problem of hallucinating a plausible color version of the photograph. This problem is clearly underconstrained, so previous approaches have either relied on significant user…
Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserting a segment amounts to: (1) deleting all the triangles it…
We propose a new algorithm for Dehn surgery problem, finding exceptional Dehn filling slopes for a given hyperbolic 3-manifold with a torus boundary, using a quantum invariant called "3D index". The invariant is defined using an ideal…
A graph G is dually chordal if there is a spanning tree T of G such that any maximal clique of G induces a subtree in T. This paper investigates the Colourability problem on dually chordal graphs. It will show that it is NP-complete in case…
We prove that if G is a triangulation of the torus and \chi(G) \neq 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors.
We propose a new geometric method of IR factorization in sector decomposition. The problem is converted into a set of problems in convex geometry. The latter problems are solved using algorithms in combinatorial geometry. This method…
We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the…
All solutions of the set-theoretic constant tetrahedron equation with two colors are found, and some of their properties are analyzed. The list includes 406 solutions - we call them R-operators, - most of which are degenerate…
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…
Computational mathematics plays an increasingly important role in computational fluid dynamics (CFD). The aeronautics and aerospace re- search community is working on next generation of CFD capacity that is accurate, automatic, and fast. A…
In this paper, we propose a novel multi-color balance method for reducing color distortions caused by lighting effects. The proposed method allows us to adjust three target-colors chosen by a user in an input image so that each target color…
In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper invstigates the more general problem of putting a set of matrices into block triangular or block-diagonal form…
A family of the Block Matching 3-D (BM3D) algorithms for various imaging problems has been recently proposed within the framework of nonlocal patch-wise image modeling [1], [2]. In this paper we construct analysis and synthesis frames,…
We propose Generative Probabilistic Image Colorization, a diffusion-based generative process that trains a sequence of probabilistic models to reverse each step of noise corruption. Given a line-drawing image as input, our method suggests…
The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…
We describe a simple, but efficient algorithm for the generation of dilated contours from bilevel images. The initial part of the contour extraction is explained to be a good candidate for parallel computer code generation. The remainder of…