On the complexity of intersecting multiple circles for graphical display

vts_6348_8536.pdf (261.3Kb)
26 Seiten
26 Seiten
Veröffentlichung
2008-03-27Authors
Messner, Jochen
Kestler, Hans A.
Müller, André
Schuler, Rainer
Arbeitspapier
Faculties
Fakultät für Ingenieurwissenschaften und InformatikSeries
Ulmer Informatik-Berichte
Abstract
Many experiments in the biomedical field generate vast amounts of data. This is especially true for microarray experiments which measure the expression levels of thousands of genes simultaneously. In this context the display of functional information attributed to the individual gene is important to obtain an overview of the major processes involved. This set data can be displayed as Euler/Venn diagrams in which the circle size corresponds to the cardinality of the set. Efficient algorithms for the calculation of intersections of circles and their resulting boundary have not been published so far. We present two algorithms (one optimal) for intersecting these different sized circles to display set relationships.
Date created
2008
Original publication
Ulmer Informatik-Berichte, Nr. 2008-01, Februar 2008Subject headings
[GND]: Graphikdisplay | Komplexes System[LCSH]: Computational complexity | Computer graphics
[DDC subject group]: DDC 004 / Data processing & computer science
Metadata
Show full item recordDOI & citation
Please use this identifier to cite or link to this item: http://dx.doi.org/10.18725/OPARU-992
Messner, Jochen et al. (2008): On the complexity of intersecting multiple circles for graphical display. Open Access Repositorium der Universität Ulm und Technischen Hochschule Ulm. http://dx.doi.org/10.18725/OPARU-992
Citation formatter >