The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Partial and approximate symmetry detection for 3D geometry
Open accessAbstract
"Symmetry is a complexity-reducing concept [...]; seek it every-where." - Alan J. PerlisMany natural and man-made objects exhibit significant symmetries or contain repeated substructures. This paper presents a new algorithm that processes geometric models and efficiently discovers and extracts a compact representation of their Euclidean symmetries. These symmetries can be partial, approximate, or both. The method is based on matching simple local shape signatures in pairs and using these matches to accumulate evidence for symmetries in an appropriate transformation space. A clustering stage extracts potential significant symmetries of the object, followed by a verification step. Based on a statistical sampling analysis, we provide theoretical guarantees on the success rate of our algorithm. The extracted symmetry graph representation captures important high-level information about the structure of a geometric model which in turn enables a large set of further processing operations, including shape compression, segmentation, consistent editing, symmetrization, indexing for retrieval, etc.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Thompson, D. W. (2019) · Stripped Bare · doi:10.1515/9780691183978-018 · Cited by 4,177
Efficient variants of the ICP algorithm
Rusinkiewicz, S., & Levoy, M. (2002) · Proceedings Third International Conference on 3-D Digital Imaging and Modeling · doi:10.1109/im.2001.924423 · Cited by 3,945
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1998) · Journal of the ACM · doi:10.1145/293347.293348 · Cited by 2,300
Geometric Hashing: A General And Efficient Model-based Recognition Scheme
Lamdan, Y., & Wolfson, H. J. (2005) · [1988 Proceedings] Second International Conference on Computer Vision · doi:10.1109/ccv.1988.589995 · Cited by 775
Machine Analysis of Bubble Chamber Pictures
Hough, P. V. C. (1959) · Conf.Proc.C · Cited by 598
An optimal algorithm for approximate nearest neighbor searching
Arya, S., Mount, D. M., Netanyahu, N. S., Silverman, R., & Wu, A. Y. (1994) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5555/314464.314652 · Cited by 594
Salient geometric features for partial shape matching and similarity
Gal, R., & Cohen-Or, D. (2006) · ACM Transactions on Graphics · doi:10.1145/1122501.1122507 · Cited by 497
Cited by
A Survey on Shape Correspondence
van Kaick, O., Zhang, H., Hamarneh, G., & Cohen‐Or, D. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01884.x · Cited by 606
Symmetry in 3D Geometry: Extraction and Applications
Mitra, N. J., Pauly, M., Wand, M., & Ceylan, D. (2013) · Computer Graphics Forum · doi:10.1111/cgf.12010 · Cited by 307
Self-citationModel Synthesis: A General Procedural Modeling Algorithm
Merrell, P., & Manocha, D. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2010.112 · Cited by 76
Recent Advancements in Learning Algorithms for Point Clouds: An Updated Overview
Camuffo, E., Mari, D., & Milani, S. (2022) · Sensors · doi:10.3390/s22041357 · Cited by 73
Discovering and exploiting 3D symmetries in structure from motion
Cohen, A., Zach, C., Sinha, S. N., & Pollefeys, M. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247841 · Cited by 67
Metadata
- Authors
- Mitra, N. J., Guibas, L. J., & Pauly, M.
- Venue
- ACM Transactions on Graphics
- Published
- 2006-07
- Volume
- 25
- Issue
- 3
- Pages
- 560-568
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2060206980
- Cited by
- 529
- References
- 25
- FWCI
- 26.63
- Type
- journal article
- 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: Partial and approximate symmetry detection for 3D geometry. https://app.cochat.ai/papers/10.1145/1141911.1141924
- The paper
- Mitra, N. J., Guibas, L. J., & Pauly, M. (2006). Partial and approximate symmetry detection for 3D geometry. ACM Transactions on Graphics. https://doi.org/10.1145/1141911.1141924
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.