The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The ball-pivoting algorithm for surface reconstruction
Abstract
The Ball-Pivoting Algorithm (BPA) computes a triangle mesh interpolating a given point cloud. Typically, the points are surface samples acquired with multiple range scans of an object. The principle of the BPA is very simple: Three points form a triangle if a ball of a user-specified radius p touches them without containing any other point. Starting with a seed triangle, the ball pivots around an edge (i.e., it revolves around the edge while keeping in contact with the edge's endpoints) until it touches another point, forming another triangle. The process continues until all reachable edges have been tried, and then starts from another seed triangle, until all points have been considered. The process can then be repeated with a ball of larger radius to handle uneven sampling densities. We applied the BPA to datasets of millions of points representing actual scans of complex 3D objects. The relatively small amount of memory required by the BPA, its time efficiency, and the quality of the results obtained compare favorably with existing techniques.
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
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37422 · Cited by 8,647
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 · cited 1×
“Memory usage can be further reduced, at the expense of a slower access, using more compact representations, such as a sparse matrix data structure.”
BackgroundThree-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
A signal processing approach to fair surface design
Taubin, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218473 · Cited by 1,855
Self-citationZippered polygon meshes from range images
Turk, G., & Levoy, M. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192241 · Cited by 1,326
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
Surface Reconstruction by Voronoi Filtering
Amenta, N., & Bern, M. (1999) · Discrete & Computational Geometry · doi:10.1007/pl00009475 · Cited by 705
Geometric structures for three-dimensional shape representation
Boissonnat, J.-D. (1984) · ACM Transactions on Graphics · doi:10.1145/357346.357349 · Cited by 581
Automatic reconstruction of surfaces and scalar fields from 3D scans
Bajaj, C. L., Bernardini, F., & Xu, G. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218424 · Cited by 292
Self-citationSurface reconstruction by Voronoi filtering
Amenta, N., & Bern, M. (1998) · Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98 · doi:10.1145/276884.276889 · Cited by 249
A general surface approach to the integration of a set of range views
Soucy, M., & Laurendeau, D. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.385982 · Cited by 237
Registration and integration of multiple object views for 3D model construction
Dorai, C., Wang, G., Jain, A. K., & Mercer, C. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.655652 · Cited by 222
Using particles to sample and control implicit surfaces
Witkin, A., & Heckbert, P. S. (1994) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/192161.192227 · Cited by 209
Sampling and Reconstructing Manifolds Using Alpha-Shapes
Bernardini, F., & Bajaj, C. (1997) · Purdue e-Pubs (Purdue University System) · Cited by 200
Self-citationEdelsbrunner, H. (1992) · Cited by 172
AUTOMATIC RECONSTRUCTION OF 3D CAD MODELS FROM DIGITAL SCANS
Bernardini, F., Bajaj, C., Chen, J., & Schikore, D. R. (1999) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195999000236 · Cited by 148
Self-citationRobust meshes from multiple range maps
Pulli, K., Duchamp, T., Hoppe, H., McDonald, J. A., Shapiro, L. G., & Stuetzle, W. (2002) · International Conference on 3-D Digital Imaging and Modeling (3DIM) · doi:10.1109/im.1997.603867 · Cited by 82
Cited by
Occupancy Networks: Learning 3D Reconstruction in Function Space
Mescheder, L., Oechsle, M., Niemeyer, M., Nowozin, S., & Geiger, A. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00459 · Cited by 2,708
Learning Implicit Fields for Generative Shape Modeling
Chen, Z., & Zhang, H. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00609 · Cited by 1,443
Pixel2Mesh: Generating 3D Mesh Models from Single RGB Images
Wang, N., Zhang, Y., Li, Z., Fu, Y., Liu, W., & Jiang, Y.-G. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-01252-6_4 · Cited by 1,306
Computing and rendering point set surfaces
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., & Silva, C. T. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1175093 · Cited by 1,089
Self-citationKITTI-360: A Novel Dataset and Benchmarks for Urban Scene Understanding in 2D and 3D
Liao, Y., Xie, J., & Geiger, A. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3179507 · Cited by 736
Metadata
- Authors
- Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., & Taubin, G.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 1999-10
- Volume
- 5
- Issue
- 4
- Pages
- 349-359
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2121535648
- Cited by
- 1,495
- References
- 18
- FWCI
- 20.87
- Type
- journal article
- 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.