Pages that link to "Item:Q1272958"
From MaRDI portal
The following pages link to Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets (Q1272958):
Displaying 10 items.
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- A divide-and-conquer strategy for embedding a distance-net point set into \(E^ n\) and its application (Q1344421) (← links)
- On finding maximum-cardinality symmetric subsets (Q1869736) (← links)
- Simple algorithms for partial point set pattern matching under rigid motion (Q2498655) (← links)
- The maximal number of 3-term arithmetic progressions in finite sets in different geometries (Q2690128) (← links)
- (Q2753922) (← links)
- Finding Largest Common Point Sets (Q3132918) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- Improved Bounds for Incidences Between Points and Circles (Q5364239) (← links)
- ALGORITHMS FOR POINT SET MATCHING WITH k-DIFFERENCES (Q5484909) (← links)
