The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
The power crust
Abstract
The power crust is a construction which takes a sample of points from the surface of a three-dimensional object and produces a surface mesh and an approximate medial axis. The approach is to first approximate the medial axis transform (MAT) of the object. We then use an inverse transform to produce the surface representation from the MAT.This idea leads to a simple algorithm with theoretical guarantees comparable to those of other surface reconstruction and medial axis approximation algorithms. It also comes with a guarantee that does not depend in any way on the quality of the input point sample. Any input gives an output surface which is the `watertight' boundary of a three-dimensional polyhedral solid: the solid described by the approximate MAT. This unconditional guarantee makes the algorithm quite robust and eliminates the polygonalization, hole-filling or manifold extraction post-processing steps required in previous surface reconstruction algorithms.In this paper, we use the theory to develop a power crust implementation which is indeed robust for realistic and even difficult samples. We describe the careful design of a key subroutine which labels parts of the MAT as inside or outside of the object, easy in theory but non-trivial in practice. We find that we can handle areas in which the input sampling is scanty or noisy by simply discarding the unreliable parts of the MAT approximation. We demonstrate good empirical results on inputs including models with sharp corners, sparse and unevenly distributed point samples, holes, and noise, both natural and synthetic.We also demonstrate some simple extensions: intentionally leaving holes where there is no data, producing approximate offset surfaces, and simplifying the approximate MAT in a principled way to preserve stable features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Surface simplification using quadric error metrics
Garland, M., & Heckbert, P. S. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258849 · Cited by 3,412
A volumetric method for building complex models from range images
Curless, B., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237269 · Cited by 3,124
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
Surface reconstruction from unorganized points
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134011 · Cited by 2,730
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Algorithms in Combinatorial Geometry.
Goodman, J. E., & Edelsbrunner, H. (1989) · The American Mathematical Monthly · doi:10.2307/2325168 · Cited by 1,788
The digital Michelangelo project
Levoy, M. (2003) · Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) · doi:10.1109/im.1999.805329 · Cited by 1,608
Algorithms in Combinatorial Geometry
Edelsbrunner, H. (1987) · Springer eBooks · doi:10.1007/978-3-642-61568-9 · Cited by 1,534
The ball-pivoting algorithm for surface reconstruction
Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., & Taubin, G. (1999) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.817351 · Cited by 1,495
(2021) · Computer Graphics Forum · doi:10.1111/(issn)1467-8659 · Cited by 1,230
A new Voronoi-based surface reconstruction algorithm
Amenta, N., Bern, M., & Kamvysselis, M. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280947 · Cited by 901
Self-citationSurface Reconstruction by Voronoi Filtering
Amenta, N., & Bern, M. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009475 · Cited by 705
Self-citationApplications of random sampling in computational geometry, II
Clarkson, K. L., & Shor, P. W. (1989) · Discrete & Computational Geometry · doi:10.1007/bf02187740 · Cited by 665
Geometric structures for three-dimensional shape representation
Boissonnat, J.-D. (1984) · ACM Transactions on Graphics · doi:10.1145/357346.357349 · Cited by 581
The power crust, unions of balls, and the medial axis transform
Amenta, N., Choi, S., & Kolluri, R. K. (2001) · Computational Geometry · doi:10.1016/s0925-7721(01)00017-7 · Cited by 526
Self-citationApproximating polyhedra with spheres for time-critical collision detection
Hubbard, P. M. (1996) · ACM Transactions on Graphics · doi:10.1145/231731.231732 · Cited by 491
Randomized incremental construction of Delaunay and Voronoi diagrams
Guibas, L. J., Knuth, D. E., & Sharir, M. (1992) · Algorithmica · doi:10.1007/bf01758770 · Cited by 479
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Boissonnat, J.-D., & Cazals, F. (2000) · Proceedings of the sixteenth annual symposium on Computational geometry · doi:10.1145/336154.336208 · Cited by 221
Computing and Simplifying 2D and 3D Continuous Skeletons
Attali, D., & Montanvert, A. (1997) · Computer Vision and Image Understanding · doi:10.1006/cviu.1997.0536 · Cited by 211
Sensor Based Motion Planning: The Hierarchical Generalized Voronoi Graph
(1997) · Algorithms for Robotic Motion and Manipulation · doi:10.1201/9781439864524-10 · Cited by 169
A fast and efficient projection-based approach for surface reconstruction
Gopi, M., & Krishnan, S. M. (2003) · Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI) · doi:10.1109/sibgra.2002.1167141 · Cited by 112
Guibas, L. J., Holleman, C., & Kavraki, L. E. (2003) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1999.813013 · Cited by 96
Object shape before boundary shape: Scale-space medial axes
Pizer, S. M., Burbeck, C. A., Coggins, J. M., et al. (1994) · Journal of Mathematical Imaging and Vision · doi:10.1007/bf01254105 · Cited by 86
Skeleton-space: a multiscale shape description combining region and boundary information
Ogniewicz (1994) · doi:10.1109/cvpr.1994.323891 · Cited by 72
Motion planning for a rigid body using random networks on the medial axis of the free space
Wilmarth, S. A., Amato, N. M., & Stiller, P. F. (1999) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/304893.304967 · Cited by 58
Assisted articulation of closed polygonal models
Teichmann, M., & Teller, S. J. (1998) · ACM SIGGRAPH Conference Abstracts and Applications · doi:10.1145/280953.282217 · Cited by 53
Blanding, R. L., Brooking, C., Ganter, M. A., & Storti, D. (1999) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/304012.304026 · Cited by 19
Cited by
Screened poisson surface reconstruction
Kazhdan, M., & Hoppe, H. (2013) · ACM Transactions on Graphics · doi:10.1145/2487228.2487237 · Cited by 2,231
Skeleton based shape matching and retrieval
Sundar, H., Silver, D., Gagvani, N., & Dickinson, S. (2003) · 2003 Shape Modeling International. · doi:10.1109/smi.2003.1199609 · Cited by 560
Surmann, H., Nüchter, A., & Hertzberg, J. (2003) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2003.09.004 · Cited by 527
Skeleton extraction by mesh contraction
Au, O. K.-C., Tai, C.-L., Chu, H.-K., Cohen-Or, D., & Lee, T.-Y. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360643 · Cited by 521
Consolidation of unorganized point clouds for surface reconstruction
Huang, H., Li, D., Zhang, H., Ascher, U., & Cohen-Or, D. (2009) · ACM Transactions on Graphics · doi:10.1145/1618452.1618522 · Cited by 487
Metadata
- Authors
- Amenta, N., Choi, S., & Kolluri, R. K.
- Venue
- Proceedings of the sixth ACM symposium on Solid modeling and applications
- Publisher
- ACM
- Published
- 2001-05
- Pages
- 249-266
- OpenAlex
- W2020065037
- Cited by
- 721
- References
- 27
- FWCI
- 63.81
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.