The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Geometric structures for three-dimensional shape representation
Open accessAbstract
Different geometric structures are investigated in the context of discrete surface representation.It is shown that minimal representations (i.e., polyhedra) can be provided by a surface-based method using nearest neighbors structures or by a volume-based method using the Delaunay triangulation.Both approaches are compared with respect to various criteria, such as space requirements, computation time, constraints on the distribution of the points, facilities for further calculations, and agreement with the actual shape of the object.
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
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
Zahn, C. T. (1971) · IEEE Transactions on Computers · doi:10.1109/t-c.1971.223083 · Cited by 1,759
Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes
Watson, D. F. (1981) · The Computer Journal · doi:10.1093/comjnl/24.2.167 · Cited by 1,487
Optimal surface reconstruction from planar contours
Fuchs, H., Kedem, Z. M., & Uselton, S. P. (1977) · Communications of the ACM · doi:10.1145/359842.359846 · Cited by 798
(1935) · Economic Record · doi:10.1111/j.1475-4932.1935.tb02774.x · Cited by 712
Convex hulls of finite sets of points in two and three dimensions
Preparata, F. P., & Hong, S. J. (1977) · Communications of the ACM · doi:10.1145/359423.359430 · Cited by 710
Zassenhaus, H., & Rogers, C. A. (1966) · The American Mathematical Monthly · doi:10.2307/2315450 · Cited by 576
Medial Axis Transformation of a Planar Shape
Lee, D. T. (1982) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1982.4767267 · Cited by 487
Optimal Expected-Time Algorithms for Closest Point Problems
Bentley, J. L., Weide, B. W., & Yao, A. C.-C. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355927 · Cited by 314
Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering
Shapiro, L. G., & Haralick, R. M. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766871 · Cited by 132
Cited by
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
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
The 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
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
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
Metadata
- Authors
- Boissonnat, J.-D.
- Venue
- ACM Transactions on Graphics
- Published
- 1984-10
- Volume
- 3
- Issue
- 4
- Pages
- 266-286
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2171094068
- Cited by
- 581
- References
- 11
- FWCI
- 6.71
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Geometric structures for three-dimensional shape representation. https://app.cochat.ai/papers/10.1145/357346.357349
- The paper
- Boissonnat, J.-D. (1984). Geometric structures for three-dimensional shape representation. ACM Transactions on Graphics. https://doi.org/10.1145/357346.357349
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.