Ali Nourollah

Learn More
The minimum Steiner tree problem, a classical combinatorial optimization problem with a long history, is a NP-complete problem. Due to its wide application, study of heuristic algorithm about Steiner tree problem has important practical and theoretical significance. In this paper we first review one of the existing algorithms for solving the Steiner problem(More)
and computational geometry is the generation of random polygons. practical evaluation of algorithms that operate on polygons, where it is necessary to check determine the actual CPU experimentally. To this time, no polynomial known for the random generation of polygons with a uniform distribution presented for generating random polygons using a set of(More)
The generation of random simple polygon and the pseudo-triangulation of a polygon are regarded as the proposed problems in computational geometry. The production of a random polygon is used in the context of the consideration of the accuracy of algorithms. In this paper, a new algorithm is presented to generate a simple spiral polygon on a set of random(More)
A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. " Ruler Folding Problem " , which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their(More)
  • 1