Pages that link to "Item:Q5056151"
From MaRDI portal
The following pages link to Improvements on geometric pattern matching problems (Q5056151):
Displaying 11 items.
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Geometry Helps to Compare Persistence Diagrams (Q4577947) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q5057419) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points (Q6182460) (← links)
- Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)
