Vasilis Capoyleas

Learn More
In generative, collstraint;..based design, users graphically select shape elements of design instances in order to specify shape operations that have generic intent. We discuss techniques for naming algorithmically and generically the identified geometric instance, and report on our experience with implementing these techniques. In a. companion paper, we(More)
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (“clusters”). For any fixed k, we can find a k-clustering which minimizes any monotone function of the diameters or the radii of the clusters in polynomial time. The algorithm is based on the fact that any two clusters in an optimal solution can be separated by(More)
  • 1