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.

Triangulation of the polygon is one of the fundamental algorithm computational geometry. This paper describes one method triangulations of a convex polygon. The notation that is obtained is expressed in the form of binary records. A presented method of triangulations is based on Lukasiewicz's algorithm and binary trees. Particularly, we present the implementation for creating binary for triangulation polygons. As evaluation of presented method we provide Java implementation for binary notation for triangulation polygons. Java application displays a correlation betwe notation and the graphical representation. of recording of polygon

This paper present a way of developing web applications for mobile devices in NetBiscuit platform which is implemented at the University of Novi Pazar. The process of implementation is based on project management of e-learning, more precisely on the application of project management (through four phases: definition, planning, management and evaluation). It's designed the combination of project management phase which enables more efficient planning and performing online education with the procedure of design courses for e-learning. The final part contains the process of integration of mobile web applications with Learning Management System (LMS).

The major purpose of this paper is to present a way of solving problems through so-called visual planning and programming using object-oriented concepts. This paper describes the process of UML modeling for solving the traveling salesman problem using one of the metaheuristic-genetic algorithms. The analysis and problem solving in this way has many advantages just because it provides a clear definition of requirements and specific plan that we will later use to create specific applications. This is a good way to resolve because the UML describes the source code, models help to visualize the system as it is or what it should be and allow you to determine the structure and behavior of the system. Static and dynamic diagrams implemented in developing tools for modeling, as well as a description of specific applications and testing are mentioned. With this approach we describe modeling tool that can be used in the development of specific solutions and a way of establishing explicit links between concepts and execution code.

In this paper we presents process of UML modeling for algorithm which is used in computational geometry and computer graphics. Implementation of algorithm for triangulation polygon is given in programming language JAVA. The main motivation is to present a way of solving problems through so-called visual planning and programming using object-oriented concepts. Dynamic and static model processing show the problem and give the plan for solving and implementation in some of objective-oriented program language. In one section of this paper we will list some research of authors and their results in the application of programming languages in the field of computer graphics. We specify reason for programming in Java in computer graphics and compared with other programming languages.