Related papers: A New Algorithm for Computing Integer Hulls of 2D …

In areas as diverse as contemporary art, play structures, climbing equipment, and modular construction toys, we see the presence of building block-like polyhedral complexes, which are generalizations of the pieces in the game Tetris. We…

We prove that, given a closure function the smallest preimage of a closed set can be calculated in polynomial time in the number of closed sets. This confirms a conjecture of Albenque and Knauer and implies that there is a polynomial time…

We present a simple and efficient acceleration technique for an arbitrary method for computing the Euclidean projection of a point onto a convex polytope, defined as the convex hull of a finite number of points, in the case when the number…

Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper,…

We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this…

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…

The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases…

We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…

Clustering is an unsupervised learning problem that aims to partition unlabelled data points into groups with similar features. Traditional clustering algorithms provide limited insight into the groups they find as their main focus is…

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…

A new predictor-corrector type incremental algorithm is proposed for the exact construction of weighted straight skeletons of 2D general planar polygons of arbitrary complexity based on the notion of deforming polygon. In the proposed…

Quickhull is an algorithm for computing the convex hull of points in a plane that performs well in practice, but has poor complexity on adversarial input. In this paper we show the same holds for the numerical stability of Quickhull.

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…

Indirect hex-dominant meshing methods rely on the detection of adjacent tetrahedra an algorithm that performs this identification and builds the set of all possible combinations of tetrahedral elements of an input mesh T into hexahedra,…

In this article we are describing a new algorithm for detecting and validating partial horizontal gene transfers (HGT). The presented algorithm is based on a sliding window procedure which analyzes fragments of the given multiple sequence…

The partition of a problem into smaller sub-problems satisfying certain properties is often a key ingredient in the design of divide-and-conquer algorithms. For questions related to location, the partition problem can be modeled, in…

Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…

Inpainting is the technique of reconstructing unknown or damaged portions of an image in a visually plausible way. Inpainting algorithm automatically fills the damaged region in an image using the information available in undamaged region.…