Information Sciences

From LRDE

Revision as of 13:59, 3 July 2018 by Bot (talk | contribs) (Created page with "{{Publication | published = true | date = 2018-07-04 | authors = Nicolas Boutry, Rocio Gonzalez-Diaz, Maria-Jose Jimenez | title = Information Sciences | journal = Journal of ...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Abstract

In previous work we proposed a combinatorial algorithm to “locally repair” the cubical complex Q(I) that is canonically associated with a given 3D picture I. The algorithm constructs a 3D polyhedral complex P(I) which is homotopy equivalent to Q(I) and whose boundary surface is a 2D manifold. A polyhedral complex satisfying these properties is called well-composed. In the present paper we extend these results to higher dimensions. We prove that for a given n-dimensional picture the obtained cell complex is well-composed in a weaker sense but is still homotopy equivalent to the initial cubical complex.

Documents

Bibtex (lrde.bib)

@Article{	  boutry.18.is,
  author	= {Nicolas Boutry and Rocio Gonzalez-Diaz and Maria-Jose
		  Jimenez},
  title		= {Information Sciences},
  journal	= {Journal of Mathematical Imaging and Vision},
  volume	= {0},
  pages		= {1--22},
  month		= jun,
  year		= {2018},
  abstract	= {In previous work we proposed a combinatorial algorithm to
		  ``locally repair'' the cubical complex Q(I) that is
		  canonically associated with a given 3D picture I. The
		  algorithm constructs a 3D polyhedral complex P(I) which is
		  homotopy equivalent to Q(I) and whose boundary surface is a
		  2D manifold. A polyhedral complex satisfying these
		  properties is called well-composed. In the present paper we
		  extend these results to higher dimensions. We prove that
		  for a given n-dimensional picture the obtained cell complex
		  is well-composed in a weaker sense but is still homotopy
		  equivalent to the initial cubical complex.}
}