New Post

Poplar Optimization Algorithm || Step-By-Step || ~xRay Pixy

Image
The Poplar Optimization Algorithm (POA) is a nature-inspired optimization method based on how poplar trees reproduce. It uses sexual propagation (seed dispersal by wind) for exploration and asexual reproduction (cutting and regrowth) for exploitation. Mutation and chaos factors help maintain diversity and prevent premature convergence, making POA efficient for solving complex optimization problems. Learn the Poplar Optimization Algorithm Step-By-Step using Examples. Video Chapters: Poplar Optimization Algorithm (POA) 00:00 Introduction 02:12 POA Applications 03:32 POA Steps 05:50 Execute Algorithm 1 13:45 Execute Algorithm 2 16:38 Execute Algorithm 3 18:15 Conclusion Main Points of the Poplar Optimization Algorithm (POA) Nature-Inspired Algorithm – Based on the reproductive mechanisms of poplar trees. Two Key Processes : Sexual Propagation (Seed Dispersal) – Uses wind to spread seeds, allowing broad exploration. Asexual Reproduction (Cuttings) – Strong branches grow ...

Line Drawing Algorithm

 Line Drawing Algorithm

We can specify points with an ordered pair of numbers ( x, y).

Where, x = horizontal distance from the origin.

     y = vertical distance from the origin. 

Suppose 2 endpoints used to specify line at position (x1, y1) and (x2, y2).

Line path between endpoints positions (x1, y1) and (x2, y2).

The equation for straight line is given by:

y = m . c + b

Here, m = slope of the line

           b  as y-intercept

The first endpoint of the line as (x1, y1)

The second endpoint of the line (x2, y2)

We can calculate values for the slope m and y-intercept b with this equation:

𝑚=(𝑦2−𝑦1)/(𝑥2−𝑥1)

b = y1 – m * x1.

For any given x interval ∆x along a line.

We can compute the corresponding y interval as ∆y as

∆y =m * ∆x 

We can obtain x interval ∆x by ∆y. 

∆x = ∆y / m 

DDA Algorithm

Step 1. Input two Endpoints (x1, y1) and (x2, y2).

Step 2: Calculate the difference between two endpoints. 

𝑑𝑥= 𝑥2−𝑥1 and dy = y2−𝑦1

Step 3: Identify the number of steps required to put pixel.

                 if (dx > dy)

                   {

              Add more steps in x coordinate. 

          }

Otherwise y coordinate. 

Step 4: Calculate the increment in x and y coordinates.

Step 5: Put the Pixel by successfully incrementing x and y coordinates. 

Step 6: Complete the Line Drawing. 


Video Link: https://youtu.be/wzxQjBgQDzc

 


Comments

Popular Post

PARTICLE SWARM OPTIMIZATION ALGORITHM NUMERICAL EXAMPLE

Cuckoo Search Algorithm for Optimization Problems

Particle Swarm Optimization (PSO)

PSO (Particle Swarm Optimization) Example Step-by-Step

PSO Python Code || Particle Swarm Optimization in Python || ~xRay Pixy

how is the LBP |Local Binary Pattern| values calculated? Step-by-Step with Example

Whale Optimization Algorithm Code Implementation || WOA CODE || ~xRay Pixy

Grey Wolf Optimization Algorithm

Grey Wolf Optimization Algorithm Numerical Example

Bat algorithm Explanation Step by Step with example