Finding optimal triangulation based on block method

In this paper we give one new proposal in finding optimal triangulation which is based on our authorial method for generating triangulation (Block method). We present two cases in calculation the triangulation weights (classical case and case based on block method). We also provide their equality and established relationship in calculation the weights for both models, with an emphasis on simplicity of calculations which occurs in the second case. The main goal of this paper is on the speed of obtaining optimal triangulation

Implementation example of the expert system for decision support on Android platform based on a specific dataset

This paper presents the method of creating Expert system for decision support on the Android platform. The system knowledge base for the given area of expertise is generated by inductive learning methods based on examples from the WEKA data research system. The system was realized using the Expert System shell for the e2gDroid lite mobile device, based on the application area and a set of training examples, specifically based on the Covertype Data Set qualification problem

Memoization method for storing of minimum-weight triangulation of a convex polygon

This study presents a practical view of dynamic programming, specifically in the context of the application of finding the optimal solutions for the polygon triangulation problem. The problem of the optimal triangulation of polygon is considered to be as a recursive substructure. The basic idea of the constructed method lies in finding to an adequate way for a rapid generation of optimal triangulations and storing - them in as small as possible memory space. The upgraded method is based on a memoization technique, and its emphasis is in storing the results of the calculated values and returning the cached result when the same values again occur. The significance of the method is in the generation of the optimal triangulation for a large number of n. All the calculated weights in the triangulation process are stored and performed in the same table. Results processing and implementation of the method was carried out in the Java environment and the experimental results were compared with the square matrix and Hurtado-Noy method

COMPUTING TRIANGULATIONS OF THE CONVEX POLYGON IN PHP/MYSQL ENVIRONMENT

In this paper we implement Block method for convex polygon triangulation in web environment (PHP/MySQL). Our main aim is to show the advantages of usage of web technologies in performing complex algorithm from computer graphics. The basic assumption is that one obtained results we store in database and use it for other calculation. Databases are convenient and structured methods of sharing and retrieving data. We have performed a comparative analysis of developed program with respect to two criteria: CPU time in generating triangulation and CPU time in reading results from database

Methods for solving the polygon triangulation problem and their implementation

The dissertation includes new methods in order to increase the speed of generating polygon triangulation. The first method is based on the process of decomposing the Catalan numbers. The second method is based on the construction of triangulation on the basis of blocks with emphasis on the possibility of storing and and working with databases in Java NetBeans environment. The dissertation will also study the above problem in terms of recording and storage in order to save storage space (the method of Alpha-numeric entry). The connection is given between notation triangulation with combinatorial problems (ballot and lattice path). The object-oriented analysis is also discussed as well as the design for the problem triangulation, with three aspects: forward, reverse and round-trip engineering

Comparative analysis of AMF, JSON and XML technologies for data transfer between the server and the client

This paper presents a comparative analysis of data formatting technology in AMF, JSON and XML, during data transfer between client and server. Data is authoring application that allows comparative analysis of these three technologies. These include aspects of the data transfer speed, the size of the output file, the data transmission safety, the code complexity of both the client and the server

Object-Oriented Analysis and Design for one Algorithm of Computational Geometry: Forward, Reverse and Round-Trip Engineering

Triangulation of the polygon is a fundamental algorithm in computational geometry. This paper considers techniques of object-oriented analysis and design as a new tool for solving and analyzing convex polygon triangulation. The triangulation is analyzed from three aspects: forward, reverse and round-trip engineering. We give a suggestion for improving the obtained software solution of the polygon triangulation algorithm using technique that combines UML modeling and Java programming