Skip to search formSkip to main contentSkip to account menu

3-dimensional matching

Known as: 3d matching, Hypergraph matching, Tripartite matching 
In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The three subsets of virions that comprise the Brome mosaic virus (BMV) were previously thought to be indistinguishable. This… 
2011
2011
This thesis describes a new framework for 3D surface landmarking and evaluates its performance for feature localisation on human… 
2009
2009
We propose to measure 3D shape similarity by matching a medial axis (MA) based representation—the medial scaffold (MS). Shape… 
2008
2008
A novel algorithm is proposed for solving the overlapped marker matching issues and satisfying speed requirement in a 3D video… 
2006
2006
In this paper, we propose a novel face recognition approach based on 2.5D/3D shape matching. While most of existing methods use… 
2002
2002
Two dimensional velocity fields have been an important tool for nearly 30 years and are instrumental in understanding galactic… 
1999
1999
Presents a method for quickly filtering range data points to make object recognition in large 3D data sets feasible. The general… 
1985
1985
We consider a PL involution of an orientable, 3-dimensional handlebody for which each component of the fixed point set is 2… 
1984
1984
Considerations preliminaires sur la roue. La roue pleine monobloc: contraintes de fabrication et defectuosites. La roue pleine…