Article detail · 2011
Coarse to Fine Combinatorial Matching for Dense Isometric ShapeCorrespondence
- Year
- 2011
- Type
- article
Data source split
- YÖKSİS YÖKSİS article record
- YÖKSİS venue COMPUTER GRAPHICS FORUM
- Catalog match (ISSN) Computer Graphics Forum
- OpenAlex OpenAlex enrichment (abstract, citations, topics)
Abstract
OpenAlex · English
Abstract We present a dense correspondence method for isometric shapes, which is accurate yet computationally efficient. We minimize the isometric distortion directly in the 3D Euclidean space, i.e., in the domain where isometry is originally defined, by using a coarse‐to‐fine sampling and combinatorial matching algorithm. Our method does not require any initialization and aims to find an accurate solution in the minimum‐distortion sense for perfectly isometric shapes. We demonstrate the performance of our method on various isometric (or nearly isometric) pairs of shapes.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
67 citations
OpenAlex cited_by_count (cache / database)
6 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- Minimum Distortion Isometric Shape Correspondence Using EM Algorithm 2012
- Coarse to Fine Isometric Shape Correspondence by Tracking SymmetricFlips 2013
- Partial 3‐D Correspondence from Shape Extremities 2014
- Dense Human Body Correspondences Using Convolutional Networks 2015
- Diffusion-based isometric depth correspondence 2019
- Reliable Isometric Point Correspondence from Depth 2017