Convex Hull Problem (Clustering Algorithm) Problem Specification 1. Write a program to computing the “convex hull” of given N points. [INPUT] - A text file having N input 2D points: 23 // # of points 3.5 242 // first point coordinates 365.12 48 // second point coordinates … [OUTPUT] - A postscript file showing the points on the convex hull as “filled circle” showing the convex hull polygon showing other points as “hallow circle” 2. Outpu.. 더보기 이전 1 ··· 146 147 148 149 150 151 152 ··· 385 다음
