The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Robust repair of polygonal models
Abstract
We present a robust method for repairing arbitrary polygon models. The method is guaranteed to produce a closed surface that partitions the space into disjoint internal and external volumes. Given any model represented as a polygon soup, we construct an inside/outside volume using an octree grid, and reconstruct the surface by contouring. Our novel algorithm can efficiently process large models containing millions of polygons and is capable of reproducing sharp features in the original geometry.
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
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Surface simplification using quadric error metrics
Garland, M., & Heckbert, P. S. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258849 · Cited by 3,412
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
Schroeder, W. J., Zarge, J. A., & Lorensen, W. E. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134010 · Cited by 1,464
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
Surface 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
Multi-level partition of unity implicits
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P. (2005) · ACM SIGGRAPH 2005 Courses on - SIGGRAPH '05 · doi:10.1145/1198555.1198649 · Cited by 722
Bollobás, B. (1979) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9967-7 · Cited by 610
Dual contouring of hermite data
Ju, T., Losasso, F., Schaefer, S., et al. (2002) · ACM SIGGRAPH Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH) · doi:10.1145/566570.566586 · Cited by 609
Self-citationAdaptively sampled distance fields: a general representation of shape for computer graphics
Frisken, S. F., Perry, R. N., Rockwood, A. P., & Jones, T. R. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344899 · Cited by 577
Multi-level partition of unity implicits
Ohtake, Y., Belyaev, A., Alexa, M., Turk, G., & Seidel, H.-P. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882293 · Cited by 530
Cohen, J., Varshney, A., Manocha, D., Turk, G., Weber, H., Agarwal, P., Brooks, F., & Wright, W. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237220 · Cited by 528
Simplification and repair of polygonal models using volumetric techniques
Nooruddin, F. S., & Turk, G. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1196006 · Cited by 504
Filling holes in complex surfaces using volumetric diffusion
Davis, J., Marschner, S. R., Garr, M., & Levoy, M. (2003) · Proceedings. First International Symposium on 3D Data Processing Visualization and Transmission · doi:10.1109/tdpvt.2002.1024098 · Cited by 439
Consistent solid and boundary representations from arbitrary polygonal data
Murali, T. M., & Funkhouser, T. A. (1997) · ACM Symposium on Interactive 3D Graphics (I3D) · doi:10.1145/253284.253326 · Cited by 117
Barequet, G., & Kumar, S. (2002) · Visualization · doi:10.1109/visual.1997.663904 · Cited by 114
Solid representation and operation using extended octrees
Brunet, P., & Navazo, I. (1990) · ACM Transactions on Graphics · doi:10.1145/78956.78959 · Cited by 95
Topology-reducing surface simplification using a discrete solid representation
Andújar, C., Brunet, P., & Ayala, D. (2002) · ACM Transactions on Graphics · doi:10.1145/508357.508359 · Cited by 80
Converting sets of polygons to manifold surfaces by cutting and stitching
Gueziec, A. P., Taubin, G., Lazarus, F., & Horn, W. (1998) · ACM SIGGRAPH Conference Abstracts and Applications · doi:10.1145/280953.281628 · Cited by 64
Advances in Modelling, Animation and Rendering
Vince, J. A., & Earnshaw, R. (2002) · Springer eBooks · doi:10.1007/978-1-4471-0103-1 · Cited by 26
3D shape representation: Transforming polygons into voxels
Oomes, S., Snoeren, P. R., & Dijkstra, T. M. H. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63167-4_69 · Cited by 21
Converting sets of polygons to manifold surfaces by cutting and stitching
Gueziec, A. P., Taubin, G., Lazarus, F., & Horn, W. (1998) · doi:10.5555/288216.288325 · Cited by 17
Cited by
SceneNN: A Scene Meshes Dataset with aNNotations
Hua, B.-S., Pham, Q.-H., Nguyen, D. T., Tran, M.-K., Yu, L.-F., & Yeung, S.-K. (2016) · 2016 Fourth International Conference on 3D Vision (3DV) · doi:10.1109/3dv.2016.18 · Cited by 333
A lightweight approach to repairing digitized polygon meshes
Attene, M. (2010) · The Visual Computer · doi:10.1007/s00371-010-0416-3 · Cited by 253
Modeling deformable objects from a single depth camera
Liao, M., Zhang, Q., Wang, H., Yang, R., & Gong, M. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459161 · Cited by 101
Metadata
- Authors
- Ju, T.
- Venue
- ACM Transactions on Graphics
- Published
- 2004-08
- Volume
- 23
- Issue
- 3
- Pages
- 888-895
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W1998255762
- Cited by
- 301
- References
- 23
- FWCI
- 26.75
- Type
- journal article
- 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.