Polygon Drawer Program plan: Include necessary header files. Define a class “PolygonApplet”. Declare and initialize the necessary variables. Define a method “init()”. Call the necessary methods to initialize the polygon. Define a method “paint()”. Call the method “setcolor()” using the graphics object “g”. Call the method “drawRect()”using the graphics object “g”. Define a method “line()”. Call the method “getGraphics()” and assign the result into the object “g”. Call the method “drawLine()” using the object “g”. Call the method “dispose()” using the object “g”. Define a method “polygon()”. The “if” loop to check “count” is less than “2”. True, return the value. Call the method “getGraphics()” and assign the result into the object “g”. The “if” loop to check “count” is equal to “2”. True, call the method “drawLine()” using the object “g”. Otherwise, call the necessary methods using the object “g” to draw a polygon. Define a method “mousePressed()” to draw a polygon. Define a method “mouseReleased()”. Define a method “mouseClicked()”. Define a method “mouseEntered()”. Define a method “mouseExited()”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 14, Problem 5PC

Program Plan Intro

Polygon Drawer

Program plan:

Include necessary header files.

Define a class “PolygonApplet”.

Declare and initialize the necessary variables.

Define a method “init()”.

Call the necessary methods to initialize the polygon.

Define a method “paint()”.

Call the method “setcolor()” using the graphics object “g”.

Call the method “drawRect()”using the graphics object “g”.

Define a method “line()”.

Call the method “getGraphics()” and assign the result into the object “g”.

Call the method “drawLine()” using the object “g”.

Call the method “dispose()” using the object “g”.

Define a method “polygon()”.

The “if” loop to check “count” is less than “2”.

True, return the value.

Call the method “getGraphics()” and assign the result into the object “g”.

The “if” loop to check “count” is equal to “2”.

True, call the method “drawLine()” using the object “g”.

Otherwise, call the necessary methods using the object “g” to draw a polygon.

Define a method “mousePressed()” to draw a polygon.

Define a method “mouseReleased()”.

Define a method “mouseClicked()”.

Define a method “mouseEntered()”.

Define a method “mouseExited()”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

solve this questions for me .

a) first player is the minimizing player. What move should be chosen?b) What nodes would not need to be examined using the alpha-beta pruning procedure?

Consider the problem of finding a path in the grid shown below from the position S to theposition G. The agent can move on the grid horizontally and vertically, one square at atime (each step has a cost of one). No step may be made into a forbidden crossed area. Inthe case of ties, break it using up, left, right, and down.(a) Draw the search tree in a greedy search. Manhattan distance should be used as theheuristic function. That is, h(n) for any node n is the Manhattan distance from nto G. The Manhattan distance between two points is the distance in the x-directionplus the distance in the y-direction. It corresponds to the distance traveled along citystreets arranged in a grid. For example, the Manhattan distance between G and S is4. What is the path that is found by the greedy search?(b) Draw the search tree in an A∗search. Manhattan distance should be used as the