The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Fitting smooth surfaces to dense polygon meshes
Open accessAbstract
Recent progress in acquiring shape from range data permits the acquisition of seamless million-polygon meshes from physical models.In this paper, we present an algorithm and system for converting dense irregular polygon meshes of arbitrary topology into tensor product B-spline surface patches with accompanying displacement maps.This choice of representation yields a coarse but efficient model suitable for animation and a fine but more expensive model suitable for rendering.The first step in our process consists of interactively painting patch boundaries over a rendering of the mesh.In many applications, interactive placement of patch boundaries is considered part of the creative process and is not amenable to automation.The next step is gridded resampling of each bounded section of the mesh.Our resampling algorithm lays a grid of springs across the polygon mesh, then iterates between relaxing this grid and subdividing it.This grid provides a parameterization for the mesh section, which is initially unparameterized.Finally, we fit a tensor product B-spline surface to the grid.We also output a displacement map for each mesh section, which represents the error between our fitted surface and the spring grid.These displacement maps are images; hence this representation facilitates the use of image processing operators for manipulating the geometric detail of an object.They are also compatible with modern photo-realistic rendering systems.Our resampling and fitting steps are fast enough to surface a million polygon mesh in under 10 minutes -important for an interactive system.
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
Cited by
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
Self-citationLeast squares conformal maps for automatic texture atlas generation
Lévy, B., Petitjean, S., Ray, N., & Maillot, J. (2002) · ACM Transactions on Graphics · doi:10.1145/566654.566590 · Cited by 699
New quadric metric for simplifiying meshes with appearance attributes
Hoppe, H. (1999) · IEEE Visualization · doi:10.5555/319351.319357 · Cited by 288
Metadata
- Authors
- Krishnamurthy, V., & Levoy, M.
- Venue
- Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
- Publisher
- ACM
- Published
- 1996-08
- Pages
- 313-324
- OpenAlex
- W1999284314
- Cited by
- 474
- References
- 1
- FWCI
- 7.53
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fitting smooth surfaces to dense polygon meshes. https://app.cochat.ai/papers/10.1145/237170.237270
- The paper
- Krishnamurthy, V., & Levoy, M. (1996). Fitting smooth surfaces to dense polygon meshes. Proceedings of the 23rd annual conference on Computer graphics and interactive techniques. https://doi.org/10.1145/237170.237270
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.