The following pages link to Helmut Alt (Q441885):
Displaying 50 items.
- Shape matching by random sampling (Q441886) (← links)
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
- (Q756425) (redirect page) (← links)
- Some classes of languages in \(NC^ 1\) (Q756426) (← links)
- On the structure of \(\Delta_ 2\!^ p\) (Q789386) (← links)
- On commutativity and approximation (Q799369) (← links)
- Complexity of normal form grammars (Q799380) (← links)
- Partial match retrieval in implicit data structures (Q800083) (← links)
- Can we compute the similarity between surfaces? (Q848860) (← links)
- Bundling three convex polygons to minimize area or perimeter (Q902419) (← links)
- Probabilistic matching of planar regions (Q1037777) (← links)
- Multiplication is the easiest nontrivial arithmetic function (Q1066671) (← links)
- (Q1148673) (redirect page) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- A lower bound for the nondeterministic space complexity of context-free recognition (Q1198017) (← links)
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures (Q1201745) (← links)
- Lower bounds on space complexity for contextfree recognition (Q1251077) (← links)
- Square rooting is as difficult as multiplication (Q1251897) (← links)
- An application of point pattern matching in astronautics (Q1332330) (← links)
- Universal 3-dimensional visibility representations for graphs (Q1384193) (← links)
- Matching convex shapes with respect to the symmetric difference (Q1386463) (← links)
- A class of point-sets with few \(k\)-sets (Q1577490) (← links)
- Congruence, similarity, and symmetries of geometric objects (Q1822962) (← links)
- Comparison of distance measures for planar curves (Q1889583) (← links)
- A method for obtaining randomized algorithms with small tail probabilities (Q1923864) (← links)
- Approximate matching of polygonal shapes (Q1924770) (← links)
- Middle curves based on discrete Fréchet distance (Q2206718) (← links)
- Wooden geometric puzzles: Design and hardness proofs (Q2272190) (← links)
- Packing 2D disks into a 3D container (Q2327534) (← links)
- Minimal link visibility paths inside a simple polygon (Q2367125) (← links)
- The Voronoi diagram of curved objects (Q2572594) (← links)
- (Q2762787) (← links)
- (Q2783509) (← links)
- Thoughts on Barnette's Conjecture (Q2800788) (← links)
- A Middle Curve Based on Discrete Fréchet Distance (Q2802924) (← links)
- Bundling Three Convex Polygons to Minimize Area or Perimeter (Q2842137) (← links)
- (Q2970472) (← links)
- Minimum Cell Connection in Line Segment Arrangements (Q3132917) (← links)
- Approximating Smallest Containers for Packing Three-Dimensional Convex Objects (Q3177900) (← links)
- (Q3206313) (← links)
- Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons (Q3387277) (← links)
- Approximating Minimum-Area Rectangular and Convex Containers for Packing Convex Polygons (Q3452765) (← links)
- COMPUTING THE HAUSDORFF DISTANCE BETWEEN CURVED OBJECTS (Q3527437) (← links)
- (Q3601572) (← links)
- Shape Matching by Random Sampling (Q3605513) (← links)
- CONSTRUCTING OPTIMAL HIGHWAYS (Q3620612) (← links)
- The Computational Geometry of Comparing Shapes (Q3644725) (← links)
- Searching Semisorted Tables (Q3700848) (← links)
- (Q3767281) (← links)
