(Enter summary)
Abstract: We construct a graph on a planar point set, which captures its shape in
the following sense: if a smooth curve is sampled densely enough, the graph
on the samples is a polygonalization of the curve, with no extraneous edges.
The required sampling density varies with the Local Feature Size on the curve,
so that areas of less detail can be sampled less densely. We give two different
graphs that, in this sense, reconstruct smooth curves: a simple new construction
which we call the crust, and the... (Update)
Similar documents based on text: More All
0.4: Shear-Wave Q And Its Frequency Dependence In The Crust Of .. - Alemayehu Jemberie And (2002)
(Correct)
0.4: Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction.. - Gold
(Correct)
0.4: A One-Step Crust and Skeleton Extraction Algorithm. - Gold, Snoeyink (2001)
(Correct)
Related documents from co-citation: More All
5: A one-step crust and skeleton extraction algorithm
- Gold, Snoeyink - 2001
5: A new Voronoi-based surface reconstruction algorithm
- Amenta, Bern et al. - 1998
4: Primitives for the manipulation of general subdivisions and the computation of V.. (context) - Guibas, Stolfi - 1985
BibTeX entry: (Update)
Amenta, N., M. Bern and D. Eppstein, 1998. The crust and the beta-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60/2:2, pp. 125-135. http://citeseer.ist.psu.edu/amenta98crust.html More
@article{ amenta98crust,
author = "N. Amenta and M. Bern and D. Eppstein",
title = "The Crust and the -Skeleton: Combinatorial Curve Reconstruction",
journal = "Graphical models and image processing: GMIP",
volume = "60",
number = "2",
month = "????",
pages = "125--??",
year = "1998",
url = "citeseer.ist.psu.edu/amenta98crust.html" }
Citations (may not include all citations):
1254
Computational Geometry: An Introduction (context) - Preparata, Shamos - 1995
481
Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1997
313
Surface reconstruction from unorganized points
- Hoppe, DeRose et al. - 1992
278
A volumetric method for building complex models from range i..
- Curless, Levoy - 1997
178
Cambridge University Press (context) - O'Rourke, in - 1994
175
Zippered polygon meshes from range images (context) - Turk, Levoy - 1994
142
A transformation for extracting new descriptors of shape (context) - Blum - 1967
73
Automatic reconstruction of surfaces and scalar fields from ..
- Bajaj, Bernadini et al. - 1995
65
A framework for computational morphology (context) - Kirkpatrick, Radke - 1998
57
Guaranteed-quality mesh generation for curved surfaces (context) - Chew - 1993
48
regular shape reconstruction from unorganized points (context) - Dominique - 1997
29
Skeleton-space: A multiscale shape description combining reg..
- Ogniewicz - 1994
27
Continuous skeleton computation by Voronoi diagram (context) - Brandt, Algazi - 1992
25
IEEE Transactions on Information Theory (context) - Edelsbrunner, Kirkpatrick et al. - 1983
7
shapes and their derivatives (context) - Mahmoud - 1997
5
Integrated skeleton and boundary shape representation for me.. (context) - Robinson, Colchester et al. - 1992
5
Computational Geometry: Theory and Applications (context) - Veltkamp - 1992
4
Graphics and Image Processing (context) - O'Rourke, Booth et al. - 1984
3
A new and simple algorithm for quality two-dimensional mesh .. (context) - Ruppert - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://net.cs.utexas.edu/users/amenta/pubs/pubs.html): More
Helly-type Theorems and Generalized Linear Programming - Amenta (1994)
(Correct)
A New Voronoi-Based Surface Reconstruction Algorithm - Amenta, Bern, Kamvysselis (1998)
(Correct)
A short proof of an interesting Helly-type theorem - Amenta (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC