70 search results - page 1 / 14 » Circular Separability of Polygons |
CORR
1999
Springer
13 years 5 months ago
1999
Springer
CEC
2009
IEEE
14 years 4 days ago
2009
IEEE
— We examine the problem of partitioning a square into convex polygons which are as circular as possible. Circular means that the polygon’s aspect ratio is supposed to be near
IJCGA
2007
13 years 5 months ago
2007
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m log m) time a data structure that uses O(m) space and allows to answer the fo...
CCCG
2003
13 years 6 months ago
2003
We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
We present an algorithm for approximating a given open polygonal curve with a minimum number of circular arcs. In computer-aided manufacturing environments, the paths of cutting t...