Logo - Fakult�t f�r Mathematik und Informatik Moving Point - Secondo Logo

Articles (1980 - 1989)

Since the excellent bibliography DBLP exists (thanks especially to Michael Ley), one can always find a  list of my publications here, that is pretty much up to date. Therefore, the list below is maintained only less frequently.


R.H. Güting,
Gral: An Extensible Relational Database System for Geometric Applications.
In: P.G. Apers and G. Wiederhold (eds.), Proc. of the 15th Intl. Conf. on Very Large Databases, Amsterdam, 1989, 33-44.
Paper.ps.gz (compressed postscript, 50 KB)
R.H. Güting, R. Zicari, and D.M. Choy,
An Algebra for Structured Office Documents.
ACM Transactions on Office Information Systems 7 (1989), 123-157.
R.H. Güting, O. Nurmi, and Th. Ottmann,
Fast Algorithms for Direct Enclosures and Direct Dominances.
Journal of Algorithms 10 (1989), 170-186.
R.H. Güting and R. Zicari,
An Introduction to the Nested Sequence of Tuples Data Model and Algebra.
In: S. Abiteboul, P.C. Fischer, and H.-J. Schek (eds.), Nested Relations and Complex Objects in Databases. LNCS 361, Springer, 1989.


R.H. Güting,
Modeling Non-Standard Database Systems by Many-Sorted Algebras.
Fachbereich Informatik, Universität Dortmund, Report 255, 1988.
R.H. Güting,
Geo-Relational Algebra: A Model and Query Language for Geometric Database Systems.
In: J.W. Schmidt, S. Ceri, and M. Missikoff (eds.), Advances in Database Technology - EDBT '88. Proc. of the Intl. Conf. on Extending Database Technology, Venice, March 1988, 506-527.
Paper.ps.gz (compressed postscript, 35 KB)


R.H. Güting and W. Schilling,
A Practical Divide-and-Conquer Algorithm for the Rectangle Intersection Problem.
Information Sciences 42 (1987), 95-112.
D.M. Choy, F. Barbic, R.H. Güting, D. Ruland, and R. Zicari,
Document Management and Handling.
Proc. of the IEEE Office Automation Symposium Gaithersburg, Maryland, 1987, 241-246.
R.H. Güting and Th. Ottmann,
New Algorithms for Special Cases of the Hidden Line Elimination Problem.
Proc. of the 2nd Annual Symposium on Theoretical Computer Science, Saarbrücken, 1985, 161-172. Journal Version: Computer Vision, Graphics, and Image Processing 40 (1987), 188-204.


R.H. Güting and D.M. Choy,
An Approach Towards Integrating Document Formatting and Filing/Retrieval.
IBM Almaden Research Center, San Jose, California, Report RJ 5119, 1986.
R.H. Güting,
Divide-and-Conquer in Planar Geometry.
International Journal of Computer Mathematics 18 (1986), 247-263.


R.H. Güting,
Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments.
Information Processing Letters 21 (1985), 165-171.
R.H. Güting, O. Nurmi, and Th. Ottmann,
The Direct Dominance Problem.
Proc. of the ACM Symposium on Computational Geometry, Baltimore, 1985, 81-88.


R.H. Güting,
Dynamic C-Oriented Polygonal Intersection Searching.
Information and Control 63 (1984), 143-163.
R.H. Güting,
Optimal Divide-and-Conquer to Compute Measure and Contour for a Set of Iso-Rectangles.
Acta Informatica 21 (1984), 271-291.
R.H. Güting,
An Optimal Contour Algorithm for Iso-Oriented Rectangles.
Journal of Algorithms 5 (1984), 303-326.
R.H. Güting and D. Wood,
Finding Rectangle Intersections by Divide-and-Conquer.
IEEE Trans. on Computers C-33 (1984), 671-675.


R.H. Güting,
Conquering Contours: Efficient Algorithms for Computational Geometry.
Fachbereich Informatik, Universität Dortmund, Dissertation, 1983.
R.H. Güting,
Stabbing C-Oriented Polygons.
Information Processing Letters 16 (1983), 35-40.


R.H. Güting and D. Wood,
The Parenthesis Tree.
Information Sciences 27 (1982), 151-162.


R.H. Güting and H.P. Kriegel,
Dynamic K-Dimensional Multiway Search under Time-Varying Access Frequencies.
Lecture Notes in Computer Science 104 (Proc. 5th GI Conf. on Theoretical Computer Science 1981), 135-145.


R.H. Güting and H.P. Kriegel,
Multidimensional B-Tree: An Efficient Dynamic File Structure for Exact Match Queries.
Informatik Fachberichte 33 (10. GI Jahrestagung 1980), 375-388.

Letzte Änderung: 2016-11-22 ()
FernUni-Logo FernUniversität in Hagen, Lehrgebiet Datenbanksysteme für neue Anwendungen, D-58084 Hagen, Telefon: +49 (2331) 987-4277