The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Direct visibility of point sets
Abstract
This paper proposes a simple and fast operator, the Hidden Point Removal operator, which determines the visible points in a point cloud, as viewed from a given viewpoint. Visibility is determined without reconstructing a surface or estimating normals. It is shown that extracting the points that reside on the convex hull of a transformed point cloud, amounts to determining the visible points. This operator is general - it can be applied to point clouds at various dimensions, on both sparse and dense point clouds, and on viewpoints internal as well as external to the cloud. It is demonstrated that the operator is useful in visualizing point clouds, in view-dependent reconstruction and in shadow casting.
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
The quickhull algorithm for convex hulls
Barber, C. B., Dobkin, D. P., & Huhdanpaa, H. (1996) · ACM Transactions on Mathematical Software · doi:10.1145/235815.235821 · Cited by 5,359
Computational Geometry: Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M. J., & Overmars, M. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,450
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 · cited 2×
“One way to compute visibility of a point cloud is to reconstruct the surface [Hoppe et al. 1992; Bernardini et al. 1999; Curless and Levoy 1996; Carr et al. 2001; Amenta et al. 2001; Amenta et al. 2002; Amenta and Kil 2004; Fleishman et al. 2005] and determine visibility on the reconstructed triangular mesh.”
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
Computer methods for mathematical computations
Forsythe, G. E., Malcolm, M. A., & Moler, C. (1977) · UCLA Biblioteca de Ingenieria Civil · Cited by 2,683
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 4×
“One way to compute visibility of a point cloud is to reconstruct the surface [Hoppe et al. 1992; Bernardini et al. 1999; Curless and Levoy 1996; Carr et al. 2001; Amenta et al. 2001; Amenta et al. 2002; Amenta and Kil 2004; Fleishman et al. 2005] and determine visibility on the reconstructed triangular mesh.”
MethodInfluentialThe ball-pivoting algorithm for surface reconstruction
Bernardini, F., Mittleman, J., Rushmeier, H., Silva, C., & Taubin, G. (1999) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.817351 · Cited by 1,495
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
Computing and rendering point set surfaces
Alexa, M., Behr, J., Cohen-Or, D., Fleishman, S., Levin, D., & Silva, C. T. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1175093 · Cited by 1,089
QSplat: a multiresolution point rendering system for large meshes
Rusinkiewicz, S., & Levoy, M. (2000) · Proceedings of the 27th annual conference on Computer graphics and interactive techniques - SIGGRAPH '00 · doi:10.1145/344779.344940 · Cited by 969
A Characterization of Ten Hidden-Surface Algorithms
Sutherland, I. E., Sproull, R. F., & Schumacker, R. A. (1974) · ACM Computing Surveys · doi:10.1145/356625.356626 · Cited by 861
Computational Geometry: Algorithms and Applications
de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997) · Springer eBooks · doi:10.1007/978-3-662-03427-9 · Cited by 800
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
Zwicker, M., Pfister, H., van Baar, J., & Gross, M. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383300 · Cited by 666
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
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
The power crust, unions of balls, and the medial axis transform
Amenta, N., Choi, S., & Kolluri, R. K. (2001) · Computational Geometry · doi:10.1016/s0925-7721(01)00017-7 · Cited by 526
Mesh segmentation using feature point and core extraction
Katz, S., Leifman, G., & Tal, A. (2005) · The Visual Computer · doi:10.1007/s00371-005-0344-9 · Cited by 375
Self-citationA survey of point-based techniques in computer graphics
Kobbelt, L., & Botsch, M. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.009 · Cited by 306
Amenta, N., & Kil, Y. J. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015713 · Cited by 305
Pointshop 3D: an interactive system for point-based surface editing
Zwicker, M., Pauly, M., Knoll, O., & Gross, M. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566584 · Cited by 294
A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION
AMENTA, N., CHOI, S., DEY, T. K., & LEEKHA, N. (2002) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195902000773 · Cited by 229
A Survey of Real‐time Soft Shadows Algorithms
Hasenfratz, J., Lapierre, M., Holzschuch, N., Sillion, F. X., & Gravir, A. (2003) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2003.00722.x · Cited by 215
Progressive point set surfaces
Fleishman, S., Cohen‐Or, D., Alexa, M., & Silva, C. T. (2003) · ACM Transactions on Graphics · doi:10.1145/944020.944023 · Cited by 157
Ray Tracing Point Sampled Geometry
Schaufler, G., & Jensen, H. W. (2000) · Eurographics · doi:10.1007/978-3-7091-6303-0_29 · Cited by 108
Point-based rendering techniques
Sainz, M., & Pajarola, R. (2004) · Computers & Graphics · doi:10.1016/j.cag.2004.08.014 · Cited by 102
Alexa, M., Groß, M. H., Pauly, M. V., Pfister, H., Stamminger, M., & Zwicker, M. (2004) · ACM SIGGRAPH Courses · doi:10.1145/1103900.1103907 · Cited by 93
Surface reconstruction from noisy point clouds
Mederos, B., Amenta, N., Velho, L. C. P. R., & de Figueiredo, L. H. (2005) · doi:10.5555/1281920.1281929 · Cited by 87
Cited by
A Survey of Surface Reconstruction from Point Clouds
Berger, M., Tagliasacchi, A., Seversky, L. M., Alliez, P., Guennebaud, G., Levine, J. A., Sharf, A., & Silva, C. T. (2017) · Computer Graphics Forum · doi:10.1111/cgf.12802 · Cited by 509
3D Face Reconstruction from a Single Image Using a Single Reference Face Shape
Kemelmacher-Shlizerman, I., & Basri, R. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.63 · Cited by 428
Self-citationVetrivel, A., Gerke, M., Kerle, N., Nex, F., & Vosselman, G. (2018) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2017.03.001 · Cited by 330
3D AffordanceNet: A Benchmark for Visual Object Affordance Understanding
Deng, S., Xu, X., Wu, C., Chen, K., & Jia, K. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00182 · Cited by 124
A novel weakly-supervised approach for RGB-D-based nuclear waste object detection
Sun, L., Zhao, C., Yan, Z., Liu, P., Duckett, T., & Stolkin, R. (2019) · IEEE Sensors Journal · doi:10.1109/jsen.2018.2888815 · Cited by 119
“Hidden points removal [33] is then applied on the 3D points,”
Method
Metadata
- Authors
- Katz, S., Tal, A., & Basri, R.
- Venue
- ACM SIGGRAPH 2007 papers
- Publisher
- ACM
- Published
- 2007-07-29
- Pages
- 24
- OpenAlex
- W2009070339
- Cited by
- 269
- References
- 28
- FWCI
- 13.61
- 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.