The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Fundamentals of spherical parameterization for 3D meshes
Abstract
Parameterization of 3D mesh data is important for many graphics applications, in particular for texture mapping, remeshing and morphing. Closed manifold genus-0 meshes are topologically equivalent to a sphere, hence this is the natural parameter domain for them. Parameterizing a triangle mesh onto the sphere means assigning a 3D position on the unit sphere to each of the mesh vertices, such that the spherical triangles induced by the mesh connectivity are not too distorted and do not overlap. Satisfying the non-overlapping requirement is the most difficult and critical component of this process. We describe a generalization of the method of barycentric coordinates for planar parameterization which solves the spherical parameterization problem, prove its correctness by establishing a connection to spectral graph theory and show how to compute these parameterizations.
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
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Differential geometry of curves and surfaces
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3330 · Cited by 3,706
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
Computing Discrete Minimal Surfaces and Their Conjugates
Pinkall, U., & Polthier, K. (1993) · Experimental Mathematics · doi:10.1080/10586458.1993.10504266 · Cited by 1,249
Tutte, W. T. (1963) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s3-13.1.743 · Cited by 1,114
Floater, M. S. (2003) · Computer Aided Geometric Design · doi:10.1016/s0167-8396(03)00002-5 · Cited by 1,079
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
Least squares conformal maps for automatic texture atlas generation
Lévy, B., Petitjean, S., Ray, N., & Maillot, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566590 · Cited by 943
Parametrization and smooth approximation of surface triangulations
Floater, M. S. (1997) · Computer Aided Geometric Design · doi:10.1016/s0167-8396(96)00031-3 · Cited by 743
Texture mapping progressive meshes
Sander, P. V., Snyder, J., Gortler, S. J., & Hoppe, H. (2001) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/383259.383307 · Cited by 727
Cited by
Surface Parameterization: a Tutorial and Survey
Floater, M. S., & Hormann, K. (2005) · Mathematics and Visualization · doi:10.1007/3-540-26808-1_9 · Cited by 874
Face transfer with multilinear models
Vlasic, D., Brand, M., Pfister, H., & Popović, J. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073209 · Cited by 556
Image-Based 3D Object Reconstruction: State-of-the-Art and Trends in the Deep Learning Era
Han, X.-F., Laga, H., & Bennamoun, M. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2954885 · Cited by 431
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
Levy, B. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.21 · Cited by 422
Spherical parametrization and remeshing
Praun, E., & Hoppe, H. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882274 · Cited by 383
Mesh Parameterization Methods and Their Applications
Sheffer, A., Praun, E., & Rose, K. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781933019895 · Cited by 352
Self-citationCross-parameterization and compatible remeshing of 3D models
Kraevoy, V., & Sheffer, A. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015811 · Cited by 323
Self-citationDiscrete Laplace–Beltrami operators for shape analysis and segmentation
Reuter, M., Biasotti, S., Giorgi, D., Patanè, G., & Spagnuolo, M. (2009) · Computers & Graphics · doi:10.1016/j.cag.2009.03.005 · Cited by 319
Deep Learning 3D Shape Surfaces Using Geometry Images
Sinha, A., Bai, J., & Ramani, K. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46466-4_14 · Cited by 298
Schreiner, J., Asirvatham, A., Praun, E., & Hoppe, H. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015812 · Cited by 265
Mesh parameterization: theory and practice
Hormann, K., Polthier, K., & Sheffer, A. (2008) · ACM SIGGRAPH ASIA 2008 courses · doi:10.1145/1508044.1508091 · Cited by 259
Self-citationJin, M., Kim, J., Luo, F., & Gu, X. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.57 · Cited by 259
Self-citationRobust 3D Shape Correspondence in the Spectral Domain
Jain, V., & Zhang, H. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.31 · Cited by 148
Metadata
- Authors
- Gotsman, C., Gu, X., & Sheffer, A.
- Venue
- ACM SIGGRAPH 2003 Papers
- Publisher
- ACM
- Published
- 2003-07
- Pages
- 358-363
- OpenAlex
- W1975446953
- Cited by
- 267
- References
- 20
- FWCI
- 18.27
- 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.