Computational aspects of digital plane and hyperplane recognition

12Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In these note we review some basic approaches and algorithms for discrete plane/hyperplane recognition. We present, analyze, and compare related theoretical and experimental results and discuss on the possibilities for creating algorithms with higher efficiency. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Coeurjolly, D., & Brimkov, V. (2006). Computational aspects of digital plane and hyperplane recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4040 LNCS, pp. 291–306). Springer Verlag. https://doi.org/10.1007/11774938_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free