Mr. Xavier Daragon Profile

Xavier Daragon

at ESIEE

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 24 November 2002 Paper

Marching Chains algorithm for Alexandroff-Khalimsky spaces

Xavier Daragon, Michel Couprie, Gilles Bertrand

Proceedings Volume 4794, (2002) https://doi.org/10.1117/12.453595

KEYWORDS: Binary data, Image segmentation, 3D image processing, Algorithm development, Surface properties, Optical spheres, Computer graphics, Vision geometry, Analog electronics, Chemical elements

Read Abstract +

The Marching Cubes algorithm is a popular method which allows the rendering of 3D binary images, or more generally of iso-surfaces in 3D digital gray-scale images. Yet the original version does not give satisfactory results from a topological point of view, more precisely the extracted mesh is not a coherent surface. This problem has been solved in the framework of digital topology, through the use of different connectivities for the object and the background, and the definition of ad-hoc templates. Another framework for discrete topology is based on an heterogeneous grid (introduced by E.D. Khalimsky) which is an order, or a discrete topological space in the sense of P.S. Alexandroff. These spaces possess nice topological properties, in particular, the notion of surface has a natural definition. This article introduces a Marching Chains algorithm for the 3D Khalimsky grid H³. Given an object X which is a subset of H³, we define, in a natural way, the frontier of X which is also an order. We prove that this frontier order is always a union of surfaces. Then we show how to use frontier order to design a Marching Cubes-like algorithm. We discuss the implementation of such an algorithm and show the results obtained on both artificial and real objects.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

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

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years