Incremental algorithm for recognizing pieces of digital planes

Isabelle Debled-Rennesson; Jean-Pierre Reveilles

doi:10.1117/12.251787

30 September 1996 Incremental algorithm for recognizing pieces of digital planes

Isabelle Debled-Rennesson, Jean-Pierre Reveilles

Proceedings Volume 2826, Vision Geometry V; (1996) https://doi.org/10.1117/12.251787
Event: SPIE's 1996 International Symposium on Optical Science, Engineering, and Instrumentation, 1996, Denver, CO, United States

Abstract

Let a 26-connected, bounded subset of Z³, such that the projection in the plane Oxy is one to one. We present an incremental algorithm which determines if this subset is or is not a piece of digital plane. This problem is solved thanks to the diophantine definition of digital planes and by using only 2D geometrical constructions.

Citation Download Citation

Isabelle Debled-Rennesson and Jean-Pierre Reveilles "Incremental algorithm for recognizing pieces of digital planes", Proc. SPIE 2826, Vision Geometry V, (30 September 1996); https://doi.org/10.1117/12.251787

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available