Pages that link to "Item:Q1207797"
From MaRDI portal
The following pages link to The upper envelope of Voronoi surfaces and its applications (Q1207797):
Displaying 50 items.
- Efficiently approximating color-spanning balls (Q284593) (← links)
- Improved algorithms for the farthest colored Voronoi diagram of segments (Q391216) (← links)
- On the central path problem (Q393050) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- Approximate one-to-one point pattern matching (Q450574) (← links)
- Farthest-polygon Voronoi diagrams (Q632728) (← links)
- Exact algorithms for the bottleneck Steiner tree problem (Q652535) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Geometric pattern matching under Euclidean motion (Q676592) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Approximate input sensitive algorithms for point pattern matching (Q733152) (← links)
- On exact solutions to the Euclidean bottleneck Steiner tree problem (Q765514) (← links)
- A new algorithm for computing the minimum Hausdorff distance between two point sets on a line under translation (Q963332) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Castles in the air revisited (Q1334929) (← links)
- Getting around a lower bound for the minimum Hausdorff distance (Q1392850) (← links)
- The weighted farthest color Voronoi diagram on trees and graphs. (Q1421027) (← links)
- Stabbing circles for sets of segments in the plane (Q1742369) (← links)
- Minimum width color spanning annulus (Q1748988) (← links)
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering (Q1774572) (← links)
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation (Q1923771) (← links)
- Color-spanning localized query (Q1998849) (← links)
- Small candidate set for translational pattern search (Q2088592) (← links)
- On the \(k\)-colored rainbow sets in fixed dimensions (Q2150582) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Color spanning objects: algorithms and hardness results (Q2181240) (← links)
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments (Q2248734) (← links)
- On the parameterized complexity of \(d\)-dimensional point set pattern matching (Q2380044) (← links)
- Applying graphics hardware to achieve extremely fast geometric pattern matching in two and three dimensional transformation space (Q2380079) (← links)
- Hausdorff matching and Lipschitz optimization (Q2457916) (← links)
- Improved approximation bounds for planar point pattern matching (Q2480906) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Color Spanning Objects: Algorithms and Hardness Results (Q2795933) (← links)
- Minimum Width Color Spanning Annulus (Q2817884) (← links)
- Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere (Q3012849) (← links)
- MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) (← links)
- The L∞ Hausdorff Voronoi Diagram Revisited (Q3449121) (← links)
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem (Q3605490) (← links)
- SMALLEST COLOR-SPANNING OBJECT REVISITED (Q3647618) (← links)
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166) (← links)
- Improvements on geometric pattern matching problems (Q5056151) (← links)
- (Q5089169) (← links)
- (Q5090454) (← links)
- Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions (Q5321701) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)
- Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model (Q5862343) (← links)
- Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended (Q5971177) (← links)
- On the role of distance transformations in Baddeley's delta metric (Q6092027) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)
