Campus Event Calendar
Event Entry
What and Who
Graph-based conservative Surface Reconstruction
Daniel Dumitriu
IMPRS
Talk
AG 1, AG 2, AG 3, AG 4, AG 5, SWS
MPI Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 31 January 2007
13:00
60 Minutes
E1 4
024
Saarbrücken
Abstract
We propose a new approach for reconstructing a 2-manifold from a point
sample in R3. Compared to previous algorithms our approach is novel in
that it throws away geometry information early on in the reconstruction
process and mainly operates combinatorially on a graph structure.
Furthermore it is very conservative in creating adjacencies between
samples in the vicinity of slivers, still we can prove that the resulting
reconstruction faithfully resembles the original 2-manifold. While the
theoretical proof requires an extremely high sampling density our
prototype implementation of the approach produces surprisingly good
results on typical sample sets and seems to have great potential.
sample in R3. Compared to previous algorithms our approach is novel in
that it throws away geometry information early on in the reconstruction
process and mainly operates combinatorially on a graph structure.
Furthermore it is very conservative in creating adjacencies between
samples in the vicinity of slivers, still we can prove that the resulting
reconstruction faithfully resembles the original 2-manifold. While the
theoretical proof requires an extremely high sampling density our
prototype implementation of the approach produces surprisingly good
results on typical sample sets and seems to have great potential.
Contact
IMPRS
9325 225
--email hidden
passcode not visible
logged in users only
Jennifer Gerling, 01/29/2007 11:13
Jennifer Gerling, 10/06/2006 10:29 -- Created document.
Jennifer Gerling, 10/06/2006 10:29 -- Created document.