Skip to main content
Journal ArticleOPEN ACCESS

d-Dimensional reverse Euclidean distance transformation and Euclidean medial axis extraction in optimal time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2886 327-337
DOI: 10.1007/978-3-540-39966-7_31
14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we present optimal in time algorithms to solve the reverse Euclidean distance transformation and the reversible medial axis extraction problems for d-dimensional images. In comparison to previous technics, the proposed Euclidean medial axis may contain less points than the classical medial axis. © Springer-Verlag Berlin Heidelberg 2003.

Author supplied keywords

Cite

CITATION STYLE

APA

Coeurjolly, D. (2003). d-Dimensional reverse Euclidean distance transformation and Euclidean medial axis extraction in optimal time. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2886, 327–337. https://doi.org/10.1007/978-3-540-39966-7_31

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