The following pages link to Thomas Ottmann (Q199233):
Displayed 50 items.
- An optimal algorithm for one-separation of a set of isothetic polygons (Q707337) (← links)
- On the definition and computation of rectilinear convex hulls (Q802314) (← links)
- Relaxed balance for search trees with local rebalancing (Q826105) (← links)
- Purely top-down updating algorithms for stratified search trees (Q1057067) (← links)
- Partitioning and separating sets of orthogonal polygons (Q1097030) (← links)
- (Q1148681) (redirect page) (← links)
- Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees (Q1148683) (← links)
- Sub-regular grammar forms (Q1160490) (← links)
- Defining families of trees with E0L grammars (Q1179185) (← links)
- Mit regulären Grundbegriffen definierbare Prädikate (Q1219876) (← links)
- Implementing dictionaries using binary trees of very small height (Q1236885) (← links)
- On the form equivalence of L-forms (Q1238427) (← links)
- Isomorphism, form equivalence and sequence equivalence of PDOL forms (Q1242695) (← links)
- On two-symbol complete EOL forms (Q1243143) (← links)
- Good OL forms (Q1245002) (← links)
- One-sided k-height-balanced trees (Q1252718) (← links)
- On the correspondence between AVL trees and brother trees (Q1254854) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- A dynamic fixed windowing problem (Q1825634) (← links)
- The ``authoring on the fly'' system for automated recording and replay of (tele)presentations (Q1856230) (← links)
- (Q2736421) (← links)
- (Q2748152) (← links)
- (Q2782238) (← links)
- Maintaining the Personal Style and Flair of Handwriting in Presentation Recordings (Q3003478) (← links)
- (Q3036710) (← links)
- Algorithms for Reporting and Counting Geometric Intersections (Q3049855) (← links)
- (Q3217599) (← links)
- (Q3325056) (← links)
- (Q3335001) (← links)
- Binary search trees with binary comparison cost (Q3335002) (← links)
- Versioning Tree Structures by Path-Merging (Q3507324) (← links)
- New Data Structures for IP Lookup and Conflict Detection (Q3637325) (← links)
- (Q3666227) (← links)
- (Q3686051) (← links)
- (Q3711731) (← links)
- (Q3727415) (← links)
- (Q3740258) (← links)
- A fast algorithm for the Boolean masking problem (Q3759941) (← links)
- (Q3795194) (← links)
- A worst-case efficient algorithm for hidden-line elimination<sup>†</sup> (Q3802610) (← links)
- New algorithms for special cases of the hidden line elimination problem (Q3805970) (← links)
- Fast algorithms for direct enclosures and direct dominances (Q3833616) (← links)
- 1-2 Brother Trees or AVL Trees Revisited (Q3875357) (← links)
- (Q3881885) (← links)
- Higher order analysis of random 1–2 brother trees (Q3885212) (← links)
- (Q3907085) (← links)
- Dense multiway trees (Q3912028) (← links)
- (Q3920670) (← links)
- (Q3928259) (← links)
- (Q3933755) (← links)