A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition
DGCI Papers Proceedings, Volume LNCS 4245, pages 639-650, 13th International Conference on Discrete Geometry for Computer Imagery, Szeged, Hungary - October 2006
A new digital hyperplane recognition method is presented. This algorithm allows the recognition of Standard and Supercover hyperplanes by incrementally computing in a dual space the generalized preimage of a given hypervoxel set. Each point in this preimage corresponds to a Euclidean hyperplane which intersects 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.
BibTex references
@InProceedings{DA2006_1589,
}
| author | = {Dexet, M. and Andres, E.}, | |
| title | = {A Generalized Preimage for the Standard and Supercover Digital Hyperplane Recognition.}, | |
| booktitle | = {DGCI Papers Proceedings}, | |
| series | = {Lecture Notes on Computer Science}, | |
| volume | = {LNCS 4245}, | |
| pages | = {639-650}, | |
| month | = {October}, | |
| year | = {2006}, | |
| publisher | = {Springer Verlag}, | |
| note | = {13th International Conference on Discrete Geometry for Computer Imagery, Szeged, Hungary}, | |
| url | = {http://dx.doi.org/10.1007/11907350_54}, |