N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, 60 (1998), 125--135. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A One-Step Crust and Skeleton Extraction Algorithm. - Gold, Snoeyink (2001) (4 citations) (Correct)
....Abstract We wish to extract the topology from scanned maps. In previous work [GNY96] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and was only useable for polygon maps. We wished to take the crust algorithm of Amenta, Bern and Eppstein [ABE98] and modify it to extract the skeleton from unlabelled vertices. We find that by reducing the algorithm to a local test on the original Voronoi diagram we may extract both a crust and a skeleton simultaneously, using a variant of the Quad Edge structure of [GS85] We show that this crust has the ....
....this process the small dumbbells represent the Quad Edge Quad Arc topology. The difficulties with this approach are that the fringe points have to be labelled, and that only polygon type maps can be produced. These limitations are overcome due to the work of Amenta, Bern and Eppstein [ABE98], who showed that the crust of a curve or polygon boundary can be extracted from unstructured (and unlabelled) input data points if the original curve is sufficiently well sampled. Their intuition was Figure 6: Voronoi diagram of sample points on curve. Figure 7: Skeleton and crust segment. ....
[Article contains additional citation context not shown here]
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.
Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction.. - Gold (18 citations) (Correct)
....City Abstract We wish to extract the topology from scanned maps. In previous work [GNY96] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and was only useable for polygon maps. We wished to take the crust algorithm of Amenta, Bern and Eppstein [ABE98] and modify it to extract the skeleton from unlabelled vertices. We find that by reducing the algorithm to a local test on the original Voronoi diagram we may extract both the crust and the skeleton simultaneously. We show that this is equivalent to the original algorithm, and illustrate its ....
....this process the small dumbbell represent the QuadEdge Quad Arc topology. The difficulties with this approach were that the fringe points had to be labelled, and that only polygon type maps could be produced. These limitations were overcome due to the work of Amenta, Bern and Eppstein [ABE98], who showed that the crust of a curve or polygon boundary could be extracted from unstructured (and unlabelled) input data points if the original curve was sufficiently well sampled. Their Figure 10: Crust and residual edges the two step approach. Figure 9: Maple leaf. intuition was that, ....
[Article contains additional citation context not shown here]
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.
Curve Reconstruction from Noisy Samples - Siu-Wing Cheng Stefan (Correct)
No context found.
N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, 60 (1998), 125--135.
Curve Reconstruction from Noisy Samples - Siu-Wing Cheng Stefan (Correct)
No context found.
N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, 60 (1998), 125--135.
Corresponding Author: - Christopher Gold Hong (2003) (Correct)
No context found.
Amenta, N., M. Bern and D. Eppstein. "The crust and the beta-skeleton: combinatorial curve reconstruction", Graphical Models and Image Processing, Vol. 60:125-135, 1998.
A One-Step Crust and Skeleton Extraction Algorithm - Gold, al. (2003) (4 citations) (Correct)
No context found.
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.
Extracting Meaningful Slopes from Terrain Contours - Maciej Dakowicz And (2003) (1 citation) (Correct)
No context found.
Amenta, N. Bern, M. and Eppstein, D. (1998) "The crust and the beta-skeleton: combinatorial curve reconstruction", Graphical Models and Image Processing, 60, 125-135.
Manifold Reconstruction from Unorganized Points - Freedman (Correct)
No context found.
N. Amenta, M. Bern, and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction. Graphical Models and Image Processing, 60(2):125--135, 1998.
Curve Reconstruction from Noisy Samples - Cheng, Funke, Golin, Kuma, Poon, .. (2003) (Correct)
No context found.
N. Amenta, M. Bern and D. Eppstein. The crust and the beta-skeleton: combinatorial curve reconstruction, Graphical Models and Image Processing, 60 (1998), 125--135.
Approximating and Intersecting Surfaces from Points - Adamson, Alexa (2003) (3 citations) (Correct)
No context found.
N. Amenta, M. Bern, and D. Eppstein. The crust and the beta-skeleton: Combinatorial curve reconstruction. Graphical Models and Image Processing, 60(2):125--135, March 1998.
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