| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655881 | Electronic Notes in Theoretical Computer Science | 2005 | 16 Pages |
Abstract
We present a deterministic algorithm for drawing Euler diagrams using n simple polygons so that the regions have a prescribed area. Our solution works for all Euler diagrams that have a region of common intersection (i.e., region {1,2,â¦,n}), and for any weight function. When there is no region for {1,2,â¦,n}, the algorithm can still be applied, but will sometimes create an Euler diagram where the curves are self-intersecting.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Stirling Chow, Frank Ruskey,