Can we compute the similarity between surfaces?
From MaRDI portal
Publication:848860
DOI10.1007/s00454-009-9152-8zbMath1184.53005OpenAlexW2147429200WikidataQ61632376 ScholiaQ61632376MaRDI QIDQ848860
Publication date: 23 February 2010
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-009-9152-8
Surfaces in Euclidean and related spaces (53A05) Computer-aided design (modeling of curves and surfaces) (65D17)
Related Items (14)
Computing the similarity between moving curves ⋮ Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes ⋮ On the set of optimal homeomorphisms for the natural pseudo-distance associated with the Lie group \(S^{1}\) ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Gromov-Fréchet distance between curves ⋮ Unnamed Item ⋮ Computing the Fréchet distance between folded polygons ⋮ Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds ⋮ Computing the Fréchet distance between simple polygons ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ The frechet distance revisited and extended ⋮ Computing the Fréchet gap distance ⋮ The Computational Geometry of Comparing Shapes ⋮ On the computability of the set of automorphisms of the unit square
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric search made practical
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- Approximate matching of polygonal shapes
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Slowing down sorting networks to obtain faster sorting algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Algorithms – ESA 2004
This page was built for publication: Can we compute the similarity between surfaces?
