Skip to main content
Conference Proceedings

Thoughts on 3d digital subplane recognition and minimum-maximum of a bilinear congruence sequence

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9448 157-171
DOI: 10.1007/978-3-319-26145-4_12
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we take first steps in addressing the 3D Digital Subplane Recognition Problem. Let us consider a digital plane P: 0 ≤ ax + by − cz + d < n = y1−y0, O(mlog (min(a, c − a)) or O(n log (min(b, c − b)) otherwise.

Author supplied keywords

Cite

CITATION STYLE

APA

Andres, E., Ouattara, D., Largeteau-Skapin, G., & Zrour, R. (2015). Thoughts on 3d digital subplane recognition and minimum-maximum of a bilinear congruence sequence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9448, pp. 157–171). Springer Verlag. https://doi.org/10.1007/978-3-319-26145-4_12

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