Login / Signup

Bounds on the Number of Compatible k-Simplices Matching the Orientation of the (k - 1)-Skeleton of a Simplex.

Karthik ChandrasekharRichard Ehrenborg
Published in: Comb. (2021)
Keyphrases
  • small number
  • matching algorithm
  • information systems
  • computational complexity
  • upper bound
  • database
  • decision trees
  • image segmentation
  • feature extraction
  • shape descriptors
  • finite number