The following pages link to Ralf Hartmut Gueting (Q1171388):
Displayed 25 items.
- Item:Q1171388 (redirect page) (← links)
- Optimal divide-and-conquer to compute measure and contour for a set of iso-rectangles (Q790614) (← links)
- Fast dynamic intersection searching in a set of isothetic line segments (Q1065550) (← links)
- A practical divide-and-conquer algorithm for the rectangle intersection problem (Q1098308) (← links)
- The parenthesis tree (Q1171389) (← links)
- Internal and external algorithms for the point-in-regions problem - the INSIDE join of georelational algebra (Q1262147) (← links)
- A simple but effective improvement to the plumb-line algorithm (Q2390322) (← links)
- (Q3316614) (← links)
- Finding Rectangle Intersections by Divide-and-Conquer (Q3323293) (← links)
- An optimal contour algorithm for iso-oriented rectangles (Q3339305) (← links)
- Dynamic C-oriented polygonal intersection searching (Q3719843) (← links)
- (Q3740285) (← links)
- Divide-and-conquer in planar geometry (Q3802611) (← links)
- New algorithms for special cases of the hidden line elimination problem (Q3805970) (← links)
- (Q3811765) (← links)
- (Q3813290) (← links)
- Fast algorithms for direct enclosures and direct dominances (Q3833616) (← links)
- (Q4024058) (← links)
- (Q4234365) (← links)
- Efficient handling of tuples with embedded large objects (Q4541456) (← links)
- (Q4674352) (← links)
- (Q4707154) (← links)
- (Q4779067) (← links)
- (Q4792794) (← links)
- Algorithms for Moving Objects Databases (Q4811516) (← links)