Searching for authors named "Vasilis Capoyleas" – sorted by Relevance.
3 documents found, showing 1 through 3.
-
A Turán-type theorem on chords of a convex polygon
- …The maximum number of straight line segments connecting n points in convex position in the plane, so that no k + 1 of them are pairwise crossing is ( 2 ) if n 2k + 1 and 2kn ( 2k+1 2 ) if n 2k + 1.…
- Cited by 15 (5 self) – Add To MetaCart
-
Geometric Clusterings
- …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 a…
- Cited by 24 (2 self) – Add To MetaCart
-
Generic naming in generative, constraint-based design
- …In generative, constraint-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 identi ed geometric instance, and report on our experience with impl…
- Cited by 23 (3 self) – Add To MetaCart
Showing 1 through 3.
