85 search results - page 3 / 17 » On Minimum Circular Arrangement |
64
Voted
INFORMS
2011
14 years 12 months ago
2011
154
click to vote
COMGEO
2008
ACM
15 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...
117
Voted
ICIAP
1997
ACM
15 years 9 months ago
1997
ACM
145
click to vote
HCI
2009
15 years 2 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
141
Voted
SIAMCOMP
2000
15 years 4 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...