The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Automatic reconstruction of B-spline surfaces of arbitrary topological type
Abstract
Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition—the 3D scanning of existing objects or clay maquettes. The problem of converting the dense point sets produced by laser scanners into useful geometric models is referred to as surface reconstruction. In this paper, we present a procedure for reconstructing a tensor product B-spline surface from a set of scanned 3D points. Unlike previous work which considers primarily the problem of fitting a single B-spline patch, our goal is to directly reconstruct a surface of arbitrary topological type. We must therefore define the surface as a network of B-spline patches. A key ingredient in our solution is a scheme for automatically constructing both a network of patches and a parametrization of the data points over these patches. In addition, we define the B-spline surface using a surface spline construction, and demonstrate that such an approach leads to an efficient procedure for fitting the surface while maintaining tangent plane continuity. We explore adaptive refinement of the patch network in order to satisfy user-specified error tolerances, and demonstrate our method on both synthetic and real data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,310
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
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
Self-citationSolving Least Squares Problems.
Ling, R. F., Lawson, C. L., & Hanson, R. J. (1977) · Journal of the American Statistical Association · doi:10.2307/2286501 · Cited by 2,723
Curves and Surfaces for Computer Aided Geometric Design--A Practical Guide.
Bajaj, C., & Farin, G. (1990) · Mathematics of Computation · doi:10.2307/2008458 · Cited by 2,123
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Curves and Surfaces for Computer-Aided Geometric Design
(1993) · Elsevier eBooks · doi:10.1016/c2009-0-22351-8 · Cited by 2,037
Zippered 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
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166119 · Cited by 1,303
Self-citationMultiresolution analysis of arbitrary meshes
Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., & Stuetzle, W. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218440 · Cited by 1,205
Self-citationSurface reconstruction from unorganized points
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1992) · ACM SIGGRAPH Computer Graphics · doi:10.1145/142920.134011 · Cited by 1,112
Self-citationPiecewise smooth surface reconstruction
Hoppe, H., DeRose, T., Duchamp, T., et al. (1994) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/192161.192233 · Cited by 691
Self-citationFitting smooth surfaces to dense polygon meshes
Krishnamurthy, V., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237270 · Cited by 474
Ma, W., & Kruth, J. (1995) · Computer-Aided Design · doi:10.1016/0010-4485(94)00018-9 · Cited by 364
Functional optimization for fair surface design
Moreton, H. P., & Séquin, C. H. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134035 · Cited by 327
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
Curves and surfaces for computer aided geometric design
Cabral, J. J. S. P. (1992) · Engineering Analysis with Boundary Elements · doi:10.1016/0955-7997(92)90103-e · Cited by 213
Surface fitting with hierarchical splines
Forsey, D. R., & Bartels, R. H. (1995) · ACM Transactions on Graphics · doi:10.1145/221659.221665 · Cited by 164
Functional optimization for fair surface design
Moreton, H., & Séquin, C. H. (1992) · ACM SIGGRAPH Computer Graphics · doi:10.1145/142920.134035 · Cited by 160
Cited by
Tang, P., Huber, D., Akinci, B., Lipman, R., & Lytle, A. (2010) · Automation in Construction · doi:10.1016/j.autcon.2010.06.007 · Cited by 1,139
Reverse engineering of geometric models—an introduction
Várady, T., Martin, R. R., & Cox, J. (1997) · Computer-Aided Design · doi:10.1016/s0010-4485(96)00054-1 · Cited by 1,116
MAPS: multiresolution adaptive parameterization of surfaces
Lee, A. W. F., Sweldens, W., Schröder, P., Cowsar, L., & Dobkin, D. (1998) · Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98 · doi:10.1145/280814.280828 · Cited by 626
Fitting smooth surfaces to dense polygon meshes
Krishnamurthy, V., & Levoy, M. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237270 · Cited by 474
Variational Problems and Partial Differential Equations on Implicit Surfaces
Bertalmı́o, M., Cheng, L.-T., Osher, S., & Sapiro, G. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2001.6937 · Cited by 352
Metadata
- Authors
- Eck, M., & Hoppe, H.
- Venue
- Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
- Publisher
- ACM
- Published
- 1996-08
- Pages
- 325-334
- OpenAlex
- W1969944427
- Cited by
- 421
- References
- 20
- FWCI
- 31.06
- 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.