The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Multi-level partition of unity implicits
Open accessAbstract
We present a new shape representation, the multi-level partition of unity implicit surface, that allows us to construct surface models from very large sets of points. There are three key ingredients to our approach: 1) piecewise quadratic functions that capture the local shape of the surface, 2) weighting functions (the partitions of unity) that blend together these local shape functions, and 3) an octree subdivision method that adapts to variations in the complexity of the local shape.Our approach gives us considerable flexibility in the choice of local shape functions, and in particular we can accurately represent sharp features such as edges and corners by selecting appropriate shape functions. An error-controlled subdivision leads to an adaptive approximation whose time and memory consumption depends on the required accuracy. Due to the separation of local approximation and local blending, the representation is not global and can be created and evaluated rapidly. Because our surfaces are described using implicit functions, operations such as shape blending, offsets, deformations and CSG are simple to perform.
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
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
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Reconstruction and representation of 3D objects with radial basis functions
Carr, J. C., Beatson, R. K., Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C., & Evans, T. R. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383266 · Cited by 1,852 · cited 8×
“2 Comparing the results of Table 1 with those of Table 2 in [Carr et al. 2001] one can find that the MPU method is 20-30 times faster than the FastRBF technique [Carr et al.”
BackgroundMethodInfluentialThe digital Michelangelo project
Levoy, M. (2003) · Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) · doi:10.1109/im.1999.805329 · Cited by 1,608
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
Self-citationTaubin, G. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.103273 · Cited by 1,147
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
Introduction to Implicit Surfaces
Bloomenthal, J., & Wyvill, B. (1997) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 683
Special Finite Element Methods for a Class of Second Order Elliptic Problems with Rough Coefficients
Babuška, I., Caloz, G., & Osborn, J. E. (1994) · SIAM Journal on Numerical Analysis · doi:10.1137/0731051 · Cited by 661
Cited by
Robust moving least-squares fitting with sharp features
Fleishman, S., Cohen-Or, D., & Silva, C. T. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073227 · Cited by 580
Deep Local Shapes: Learning Local SDF Priors for Detailed 3D Reconstruction
Chabra, R., Lenssen, J. E., Ilg, E., Schmidt, T., Straub, J., Lovegrove, S., & Newcombe, R. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58526-6_36 · Cited by 380
3D reconstruction methods for digital preservation of cultural heritage: A survey
Gomes, L., Regina Pereira Bellon, O., & Silva, L. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2014.03.023 · Cited by 267
Wen, C., Sun, X., Li, J., Wang, C., Guo, Y., & Habib, A. (2019) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2018.10.007 · Cited by 158
Robust principal axes determination for point-based shapes using least median of squares
Liu, Y.-S., & Ramani, K. (2009) · Computer-Aided Design · doi:10.1016/j.cad.2008.10.012 · Cited by 46
Metadata
- Authors
- Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P.
- Venue
- ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05
- Publisher
- ACM Press
- Published
- 2005
- Pages
- 173
- OpenAlex
- W2099953968
- Cited by
- 722
- References
- 26
- Type
- conference abstract
- Language
- en
- Open access
- green
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: Multi-level partition of unity implicits. https://app.cochat.ai/papers/10.1145/1198555.1198649
- The paper
- Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P. (2005). Multi-level partition of unity implicits. ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05. https://doi.org/10.1145/1198555.1198649
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.
