346 search results - page 3 / 70 » Isodiametric Problems for Polygons |
AUSAI
1999
Springer
13 years 10 months ago
1999
Springer
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
ICCS
2003
Springer
13 years 11 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
ESA
2009
Springer
14 years 10 days ago
2009
Springer
Bose et al. [2] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prov...
WALCOM
2010
IEEE
14 years 21 days ago
2010
IEEE
DCG
2002
13 years 5 months ago
2002
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...