Fabian Lipp

Learn More
  • F J Lipp
  • 1989
This paper describes the interdisciplinary methods used in the recording and collecting of ethnopharmacological field data. General considerations of procedure and interviewing, the collection of botanical and pharmacological specimens, procedures of data collection in field studies of medicinal plants, and the field screening of drug plants are discussed.
  • F J Lipp
  • 1996
Herbal medicine is the oldest and most widely used form of medicine in the world today. Yet medicinal herbs that formerly were held in esteem now are commonly dismissed as placebos. This article reviews the state of plant-derived drug research and discusses the efficacy and safety of herbal medicines within the context of the contemporary political and(More)
The force-directed paradigm is one of the few generic approaches to drawing graphs. Since force-directed algorithms can be extended easily, they are used frequently. Most of these algorithms are, however, quite slow on large graphs, as they compute a quadratic number of forces in each iteration. We give a new algorithm that takes only O(m + n log n) time(More)
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections to other challenging graph-drawing problems such as small-area or small-volume drawings, layered or track drawings, and(More)
Obstacle representations of graphs have been investigated quite intensely over the last few years. We focus on graphs that can be represented by a single obstacle. Given a (topologically open) polygon C and a finite set P of points in general position in the complement of C, the visibility graph G C (P) has a vertex for each point in P and an edge pq for(More)
We introduce and study the OrthoSEFE-k problem: Given k planar graphs each with maximum degree 4 and the same vertex set, do they admit an OrthoSEFE, that is, is there an assignment of the vertices to grid points and of the edges to paths on the grid such that the same edges in distinct graphs are assigned the same path and such that the assignment induces(More)