Skip to Main content Skip to Navigation
Journal articles

A generalized preimage for the digital analytical hyperplane recognition

Abstract : A new digital hyperplane recognition method is presented. This algorithm allows the recognition of digital analytical hyperplanes, such as Naive, Standard and Supercover ones. The principle is to incrementally compute in a dual space the generalized preimage of the ball set corresponding to a given hypervoxel set according to the chosen digitization model. Each point in this preimage corresponds to a Euclidean hyperplane the digitization of which contains all given hypervoxels. An advantage of the generalized preimage is that it does not depend on the hypervoxel locations. Moreover, the proposed recognition algorithm does not require the hypervoxels to be connected or ordered in any way.
Complete list of metadata
Contributor : Eric Andres <>
Submitted on : Wednesday, January 21, 2009 - 10:32:24 AM
Last modification on : Wednesday, September 5, 2018 - 1:30:09 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 6:09:54 PM


Files produced by the author(s)



Martine Dexet, Eric Andres. A generalized preimage for the digital analytical hyperplane recognition. Discrete Applied Mathematics, Elsevier, 2009, 157 (3), pp.476-489. ⟨10.1016/j.dam.2008.05.030⟩. ⟨hal-00354684⟩



Record views


Files downloads