TY - GEN
AU - Peckhaus, Volker
ID - 18329
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 918.01015]
TI - van Dalen, Dirk, “The Role of Language in Brouwer’s Work”, in: Ewa Orłowska (Hg.), Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Physica-Verlag: Heidelberg 1999, 3–14
ER -
TY - GEN
AU - Peckhaus, Volker
ID - 18317
T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 908.01013]
TI - Stelzner, Werner, Gottlob Frege. Jena und die Geburt der modernen Logik, ReFIT: Jena 1996
ER -
TY - CONF
AB - A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the quality of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:
* k determines the amount of space required for storing PNGs.
* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.
Our results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.
AU - Fischer, Matthias
AU - Lukovszki, Tamas
AU - Ziegler, Martin
ID - 17864
T2 - Proceedings of the 11th Canadian Conference on Computational Geometry
TI - Partitioned neighborhood spanners of minimal outdegree
ER -
TY - JOUR
AU - Tophinke, Doris
ID - 18362
JF - Niederdeutsches Jahrbuch
TI - Das kaufmännische Rechnungsbuch im Kontext städtisch-amtlicher Schriftlichkeit
VL - 122
ER -
TY - BOOK
ED - Tophinke, Doris
ID - 18451
TI - Handelstexte – Zu Textualität und Typik kaufmännischer Rechnungsbücher im Hanseraum des 14. und 15. Jahrhunderts
ER -
TY - CONF
AB - In this paper we deal with two problems on star-shaped polygons. First, we present a Las-Vegas algorithm that uniformly at random creates a star-shaped polygon whose vertices are given by a point set ( S ) of ( n ) points in the plane that does not admit degenerate star-shaped polygons. The expected running time of the algorithm is ( O(n^2log n) ) and it uses ( O(n) ) memory. We call a star-shaped polygon degenerate if its kernel has 0 area.

Secondly, we show how to count all star-shaped polygons whose vertices are a subset of ( S ) in ( O(n^5log n) ) time and ( O(n) ) space. The algorithm can also be used for random uniform generation. We also present lower and upper bounds on the number of star-shaped polygons.
AU - Sohler, Christian
ID - 18576
T2 - Proceedings of the 11th Canadian Conference on Computational Geometry ('CCCG'99)
TI - Generating Random Star-Shaped Polygons
ER -
TY - CONF
AB - We present a new ( O(n) ) algorithm to compute good orders for the point set of a Delaunay triangulation of ( n ) points in the plane. Such a good order makes reconstruction in ( O(n) ) time with a simple algorithm possible. In contrast to the algorithm of Snoeyink and van Kreveld cite1, which is based on independent sets, our algorithm uses a breadth first search (BFS) to obtain these orders. Both approaches construct such orders by repeatedly removing a constant fraction of vertices from the current triangulation. The advantage of the BFS approach is that we can give significantly better bounds on the fraction of removed points in a phase of the algorithm. We can prove that a single phase of our algorithm removes at least ( frac13 ) of the points, even if we restrict the degree of the points (at the time they are removed) to 6. We implemented and compared both algorithms. Our algorithms is slightly faster and achieves about 15% better vertex data compression when using a simple variable length code to encode the differences between two consecutive vertices of the given order.
AU - Sohler, Christian
ID - 18747
T2 - Proceedings of the 11th Canadian Conference on Computational Geometry ( CCCG'99)
TI - Fast Reconstruction of Delaunay Triangulations
ER -
TY - BOOK
AB - Neuausgabe als E-Book: Stuttgart 2015
AU - Eke, Norbert Otto
ID - 19017
TI - Heiner Müller
ER -
TY - JOUR
AB - Angabe zur Herausgeberschaft: hg. von Frank Hörnigk
AU - Eke, Norbert Otto
ID - 19404
IS - H. 4
JF - Zeitschrift für deutsche Philologie
TI - Heiner Müller, Die Gedichte
VL - 118
ER -
TY - GEN
AU - Eke, Norbert Otto
ED - Max, Frank Rainer
ED - Ruhrberg, Christine
ID - 19461
T2 - Reclams Romanlexikon. Bd. 2: Von der Romantik bis zum Naturalismus
TI - Nikolaus Lenau: Savonarola. Ein Gedicht; Die Albigenser. Freie Dichtungen
ER -