The DOI matches its Crossref record.
Least-squares meshes
Abstract
In this paper we introduce least-squares meshes: meshes with a prescribed connectivity that approximate a set of control points in a least-squares sense. The given mesh consists of a planar graph with arbitrary connectivity and a sparse set of control points with geometry. The geometry of the mesh is reconstructed by solving a sparse linear system. The linear system not only defines a surface that approximates the given control points, but it also distributes the vertices over the surface in a fair way. That is, each vertex lies as close as possible to the center of gravity of its immediate neighbors. The least-squares meshes (LS-meshes) are a visually smooth and fair approximation of the given control points. We show that the connectivity of the mesh contains geometric information that affects the shape of the reconstructed surface. Finally, we discuss the applicability of LS-meshes to approximation of given surfaces, smooth completion and mesh editing.
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
Cited by
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
Self-citationNealen, A., Igarashi, T., Sorkine, O., & Alexa, M. (2006) · Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia · doi:10.1145/1174429.1174494 · Cited by 340
Self-citationPaulovich, F. V., Nonato, L. G., Minghim, R., & Levkowitz, H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70443 · Cited by 316
Point Cloud Skeletons via Laplacian Based Contraction
Cao, J., Tagliasacchi, A., Olson, M., Zhang, H., & Su, Z. (2010) · 2010 Shape Modeling International Conference · doi:10.1109/smi.2010.25 · Cited by 313
FiberMesh: designing freeform surfaces with 3D curves
Nealen, A., Igarashi, T., Sorkine, O., & Alexa, M. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276429 · Cited by 302
Self-citation
Metadata
- Authors
- Sorkine, O., & Cohen-Or, D.
- Venue
- Proceedings Shape Modeling Applications, 2004.
- Publisher
- IEEE
- Published
- 2004-11-13
- Pages
- 191-199
- OpenAlex
- W2121669559
- Cited by
- 173
- References
- 0
- FWCI
- 5.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Least-squares meshes. https://app.cochat.ai/papers/10.1109/smi.2004.1314506
- The paper
- Sorkine, O., & Cohen-Or, D. (2004). Least-squares meshes. Proceedings Shape Modeling Applications, 2004. https://doi.org/10.1109/smi.2004.1314506
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.