On the public citation graph

Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation

https://doi.org/10.1007/bf02716804
0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferredcites →https://doi.org/10.1007/3-540-55706-7_28openalex-snapshot
Improvements on geometric pattern matching problems
inferredcites →https://doi.org/10.1007/bf01530830openalex-snapshot
Approximate matching of polygonal shapes
inferredcites →https://doi.org/10.1007/bf02189323openalex-snapshot
The upper envelope of voronoi surfaces and its applications
inferredcites →https://doi.org/10.1016/0020-0190(91)90233-8openalex-snapshot
Computing the minimum Hausdorff distance between two point sets on a line under translation
inferredcites →https://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferredcites →https://doi.org/10.1109/cvpr.1993.341019openalex-snapshot
A multi-resolution technique for comparing images using the Hausdorff distance
inferredcites →https://doi.org/10.1145/109648.109669openalex-snapshot
Approximate matching of polygonal shapes (extended abstract)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_13openalex-snapshot
Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions
inferred← citeshttps://doi.org/10.1007/s00454-002-2884-3openalex-snapshot
Combinatorial Geometry Problems in Pattern Recognition
inferred← citeshttps://doi.org/10.1016/j.cad.2011.02.008openalex-snapshot
Polyline approach for approximating Hausdorff distance between planar free-form curves
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.04.021openalex-snapshot
Geometric pattern matching for point sets in the plane under similarity transformations
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.020openalex-snapshot
Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions
inferred← citeshttps://doi.org/10.1109/sma.2001.923389openalex-snapshot
Shape matching: similarity measures and algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611975482.180openalex-snapshot
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability
inferred← citeshttps://doi.org/10.1145/1531326.1531380openalex-snapshot
Interactive Hausdorff distance computation for general polygonal models
inferred← citeshttps://doi.org/10.1145/1576246.1531380openalex-snapshot
Interactive Hausdorff distance computation for general polygonal models
inferred← citeshttps://doi.org/10.1145/3460656openalex-snapshot
Discrete Fréchet Distance under Translation
inferred← citeshttps://doi.org/10.20382/jocg.v13i2a3openalex-snapshot
Translating Hausdorff Is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
inferred← citeshttps://doi.org/10.5555/365411.365463openalex-snapshot
Pattern matching for sets of segments
inferred← citeshttps://doi.org/10.70675/ddba8ddcz741cz43c4z9766z55aab03cfc2copenalex-snapshot
Aide à la décision pour le remplacement valvulaire aortique percutané
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.