javapackage p1008; import javax.swing.*; import java.awt.*; import java.awt.image.BufferedImage; import java.io.File; import java.io.IOException; import javax.imageio.ImageIO; public class CirclePoints extends JPanel { private int n; // Number of points private final int radius = 200; // Radius of the circle public CirclePoints(int n) { this.n = n; } @Override protected void paintComponent(Graphics g) { super.paintComponent(g); Graphics2D g2d = (Graphics2D) g; // Calculate the center of the panel int centerX = getWidth() / 2; int centerY = getHeight() / 2; // Draw points and connect them double angleIncrement = 2 * Math.PI / n; int[] xPoints = new int[n]; int[] yPoints = new int[n]; for (int i = 0; i < n; i++) { double angle = i * angleIncrement; int x = (int) (centerX + radius * Math.cos(angle)); int y = (int) (centerY + radius * Math.sin(angle)); xPoints[i] = x; yPoints[i] = y; // Draw the point g2d.fillOval(x - 5, y - 5, 10, 10); } // Connect the points for (int i = 0; i < n; i++) { for(int j=i+1;j<n;j++){ g2d.drawLine(xPoints[i], yPoints[i], xPoints[j], yPoints[j]); } } } public static void main(String[] args) { int n = Integer.parseInt(JOptionPane.showInputDialog("请输入一个5到36之间的整数:")); if (n < 5 || n > 36) { System.out.println("输入无效,请输入5到36之间的整数。"); return; } JFrame frame = new JFrame("Circle Points"); CirclePoints circlePoints = new CirclePoints(n); frame.add(circlePoints); frame.setSize(500, 500); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); frame.setVisible(true); // Save the panel as an image BufferedImage image = new BufferedImage(frame.getWidth(), frame.getHeight(), BufferedImage.TYPE_INT_RGB); Graphics2D g2d = image.createGraphics(); circlePoints.paint(g2d); g2d.dispose(); try { ImageIO.write(image, "jpg", new File("res.jpg")); System.out.println("图片已保存为 res.jpg"); } catch (IOException e) { e.printStackTrace(); } } }
使用 java画图。
laocooon5238578862024-10-15 20:42
相关推荐
xiaoshiguang33 小时前
LeetCode:222.完全二叉树节点的数量爱吃西瓜的小菜鸡3 小时前
【C语言】判断回文别NULL3 小时前
机试题——疯长的草TT哇3 小时前
*【每日一题 提高题】[蓝桥杯 2022 国 A] 选素数yuanbenshidiaos4 小时前
C++----------函数的调用机制唐叔在学习4 小时前
【唐叔学算法】第21天:超越比较-计数排序、桶排序与基数排序的Java实践及性能剖析ALISHENGYA5 小时前
全国青少年信息学奥林匹克竞赛(信奥赛)备考实战之分支结构(switch语句)chengooooooo5 小时前
代码随想录训练营第二十七天| 贪心理论基础 455.分发饼干 376. 摆动序列 53. 最大子序和jackiendsc5 小时前
Java的垃圾回收机制介绍、工作原理、算法及分析调优游是水里的游6 小时前
【算法day20】回溯:子集与全排列问题