Computational surface flattening: A voxel-based approach

Ruth Grossmann, Nahum Kiryati*, Ron Kimmel

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A voxel-based method for flattening a surface while best preserving the distances is presented. Triangulation or polyhedral approximation of the voxel data are not required. The problem is divided into two main subproblems: Voxel-based calculation of the minimal geodesic distances between the points on the surface, and finding a configuration of points in 2-D that has Euclidean distances as close as possible to the minimal geodesic distances. The method suggested combines an efficient voxel-based hybrid distance estimation method, that takes the continuity of the underlying surface into account, with classical multi-dimensional scaling (MDS) for finding the 2-D point configuration. The proposed algorithm is efficient, simple, and can be applied to surfaces that are not functions. Experimental results are shown.

Original languageEnglish
Title of host publicationVisual Form 2001 - 4th International Workshop on Visual Form, IWVF4, Proceedings
EditorsCarlo Arcelli, Gabriella Sanniti di Baja, Luigi P. Cordella
PublisherSpringer Verlag
Pages196-204
Number of pages9
ISBN (Print)3540421203, 9783540421207
DOIs
StatePublished - 2001
Event4th International Workshop on Visual Form, IWVF4 2001 - Capri, Italy
Duration: 28 May 200130 May 2001

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2059
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Workshop on Visual Form, IWVF4 2001
Country/TerritoryItaly
CityCapri
Period28/05/0130/05/01

Fingerprint

Dive into the research topics of 'Computational surface flattening: A voxel-based approach'. Together they form a unique fingerprint.

Cite this