The directed Hausdorff distance between imprecise point sets (Q553353): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2011.01.039
+Normal rank
@@ Property / OpenAlex ID @@
+W2025309272
@@ Property / OpenAlex ID: W2025309272 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Discrete Fréchet Distance with Imprecise Input
+Normal rank
@@ Property / cites work @@
+Approximate matching of polygonal shapes
@@ Property / cites work: Approximate matching of polygonal shapes / rank @@
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Voronoi diagrams
@@ Property / cites work: A sweepline algorithm for Voronoi diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Stabbing parallel segments with a convex polygon
@@ Property / cites work: Stabbing parallel segments with a convex polygon / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Largest bounding box, smallest diameter, and related problems on imprecise points
+Normal rank
@@ Property / cites work @@
+ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA
+Normal rank
@@ Property / cites work @@
+On intersecting a set of parallel line segments with a convex polygon of minimum area
+Normal rank
@@ Property / cites work @@
+Q4547814
@@ Property / cites work: Q4547814 / rank @@
+Normal rank