Ralf Hartmut Gueting

Available identifiers

zbMath Open guting.ralf-hartmutMaRDI QIDQ1171388

List of research outcomes

Publication	Date of Publication	Type
A simple but effective improvement to the plumb-line algorithm	2009-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q4674352	2005-05-11	Paper
Algorithms for Moving Objects Databases	2004-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q4707154	2003-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4792794	2003-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q4779067	2002-11-24	Paper
Efficient handling of tuples with embedded large objects	2002-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q4234365	1999-03-16	Paper
https://portal.mardi4nfdi.de/entity/Q4024058	1993-01-23	Paper
Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra	1990-01-01	Paper
Fast algorithms for direct enclosures and direct dominances	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3811765	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3813290	1988-01-01	Paper
New algorithms for special cases of the hidden line elimination problem	1987-01-01	Paper
A practical divide-and-conquer algorithm for the rectangle intersection problem	1987-01-01	Paper
Divide-and-conquer in planar geometry	1986-01-01	Paper
Fast dynamic intersection searching in a set of isothetic line segments	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3740285	1985-01-01	Paper
Finding Rectangle Intersections by Divide-and-Conquer	1984-01-01	Paper
Dynamic C-oriented polygonal intersection searching	1984-01-01	Paper
An optimal contour algorithm for iso-oriented rectangles	1984-01-01	Paper
Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles	1984-01-01	Paper
The parenthesis tree	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3316614	1982-01-01	Paper

Research outcomes over time

This page was built for person: Ralf Hartmut Gueting