Share Email Print

Proceedings Paper

Incremental algorithm for recognizing pieces of digital planes
Author(s): Isabelle Debled-Rennesson; Jean-Pierre Reveilles
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Let a 26-connected, bounded subset of Z3, 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.

Paper Details

Date Published: 30 September 1996
PDF: 12 pages
Proc. SPIE 2826, Vision Geometry V, (30 September 1996); doi: 10.1117/12.251787
Show Author Affiliations
Jean-Pierre Reveilles, LLAICI (France)

Published in SPIE Proceedings Vol. 2826:
Vision Geometry V
Robert A. Melter; Angela Y. Wu; Longin Jan Latecki, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?