Cart (Loading....) | Create Account
Close category search window
 

Digital geometry fundaments: application to plane recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chassery, J.M. ; LIS, ENSIEG, Saint-Martin d''Heres, France ; Dupont, F. ; Sivignon, I. ; Vittone, J.

Triangulation, quadrangulation problems and more generally 3D object polyhedrization are an important subject of research. In digital geometry, a 3D object is seen as a set of voxels placed in a representation space only constituted of integers. The objective of the polyhedrization is to obtain a complete description of the object with faces, edges and vertices. The recognition of digital planes is a first step which is very important. We focus on digital naive planes that have been studied through their configurations of tricubes: of (n,m)-cubes and connected or not connected voxels set. The link between the normal equation of a plane and configuration of voxels set has been studied by the construction of the corresponding Farey net. We can find many references about the recognition of digital planes. Some algorithms were related to the construction of the convex hull of the studied voxels set. Other approaches use linear programming, mean square approximation or Fourier-Motzkin transform. The first algorithms entirely discrete recognized rectangular pieces of naive planes. Wwe describe an incremental algorithm to recognize any coplanar voxels set as a digital naive plane by using Farey nets. Then we propose a polyhedrization method able to give all the digital naive planes of the surface of the 3D object

Published in:

Image Analysis and Processing, 2001. Proceedings. 11th International Conference on

Date of Conference:

26-28 Sep 2001

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.