Mesh simplification and mesh compression are important processes in computer graphics and scientific computing, as such contexts allow for a mesh which takes up less memory than the original mesh. Current simplification and compression algorithms do not take advantage of both the central processing unit (CPU) and the graphics processing unit (GPU). We propose three simplification algorithms, on...

We present a formalism within which the relationship (discovered by Drinfel’d in [Dr1, Dr2]) between associators (for quasi-triangular quasi-Hopf algebras) and (a variant of) the Grothendieck-Teichmuller group becomes simple and natural, leading to a great simplification of Drinfel’d’s original work. In particular, we re-prove that rational associators exist and can be constructed iteratively.

The paper presents the design of a hardware genetic algorithm which uses a pipeline of systolic arrays. Demostrated is the design methodology, where a simple genetic algorithm expressed in C source code is progressivly re-written into a recurrence form from which systolic structures can be deduced. The paper extends previous work by the authors by introducing a simplification to a previous syst...

Line simplification is an important method in the context of cartographic generalization, which is helpful for improving the visualization of digital vector maps. The evaluation method for the simplification algorithms is still an open issue when facing applications of vector data, including progressive transmission, web mapping, and so on. This paper proposes a novel evaluation approach for li...

In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based geometric simplification algorithms develop a hierarchy of collapses such that during uncollapse the reverse order has to be maintained. We show that restricting the simplification and refinement operations only to, w...

The focus of the this work is a simplified integration of algorithms expressed in Geometric Algebra (GA) in modern high level computer languages, namely C++, OpenCL and CUDA. A high runtime performance in terms of GA is achieved using symbolic simplification and code generation by a Precompiler that is directly integrated into CMake-based build toolchains.

Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simplz+ztion of the co...

In this paper, we investigate the impact of an object simplification approach in registration using the Iterative Closest Point (ICP) algorithm. Though the simplification of the objects remarkably reduces the registration time, it also raises a critical issue, whether the simplified version of the object carries sufficient information to recover the proper geometric parameters of registration. ...

We provide several methods for sentencealignment of texts with different complexity levels. Using the best of them, we sentence-align the Newsela corpora, thus providing large training materials for automatic text simplification (ATS) systems. We show that using this dataset, even the standard phrase-based statistical machine translation models for ATS can outperform the state-of-the-art ATS sy...