Efficient Computation of Isometry‐Invariant Distances Between Surfaces
DOI10.1137/050639296zbMATH Open1123.65010OpenAlexW2005276292MaRDI QIDQ3593035FDOQ3593035
Authors: Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel
Publication date: 24 September 2007
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050639296
Recommendations
- Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- A numerical framework for elastic surface matching, comparison, and interpolation
- Conformal Wasserstein distances: comparing surfaces in polynomial time
- Continuous Procrustes distance between two surfaces
numerical examplesintrinsic geometryisometric embeddingGromov-Hausdorff distanceiterative optimizationmultiresolution methodsgeneralized multidimensional scalingisometry-invariant surface matching
Cited In (35)
- A survey of geodesic paths on 3D surfaces
- Equi-affine invariant geometry for shape analysis
- Gromov-Wasserstein distances and the metric approach to object matching
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
- Hierarchical shape segmentation and registration via topological features of Laplace-Beltrami eigenfunctions
- Three-Dimensional Moment Invariants
- Analysis of two-dimensional non-rigid shapes
- Topology-invariant similarity of nonrigid shapes
- 3D shape retrieval using kernels on extended Reeb graphs
- Comparing shapes of genus-zero surfaces
- A construction method for surface isometric invariants
- Compressed vibration modes of elastic bodies
- Manifold Intrinsic Similarity
- Nonisometric surface registration via conformal Laplace-Beltrami basis pursuit
- Some properties of Gromov-Hausdorff distances
- The Gromov-Hausdorff distance: a brief tutorial on some of its quantitative aspects
- Conformal Wasserstein distance: II. Computational aspects and extensions
- On Computing the Fréchet Distance Between Surfaces.
- Affine invariant geometry for non-rigid shapes
- Computing Isophotes on Free-Form Surfaces Based on Support Function Approximation
- Computational aspects of the Gromov-Hausdorff distance and its application in non-rigid shape matching
- A spectral notion of Gromov-Wasserstein distance and related methods
- Feature matching with bounded distortion
- A theoretical and computational framework for isometry invariant recognition of point cloud data
- FPT-algorithms for computing Gromov-Hausdorff and interleaving distances between trees
- Globally optimal joint image segmentation and shape matching based on Wasserstein modes
- Gromov-Hausdorff distances from simply connected geodesic spaces to the circle
- Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
- The ultrametric Gromov-Wasserstein distance
- Distances between datasets
- LRA: local rigid averaging of stretchable non-rigid shapes
- Three-dimensional occlusion detection and restoration of partially occluded faces
- On efficient computation of inter-simplex Chebyshev distance for voxelization of 2-manifold surface
- Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain
- On the optimality of shape and data representation in the spectral domain
This page was built for publication: Efficient Computation of Isometry‐Invariant Distances Between Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593035)