The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Decomposing polygon meshes for interactive applications
Abstract
This paper discusses an efficient and effective framework to decompose polygon meshes into components. This is useful in various interactive graphics applications, such as, mesh editing, establishing correspondence between objects for morphing, computation of bounding volume hierarchy for collision detection and ray tracing. In this paper, we formalize the notion of a component as a sub-volume of an object with homogeneous geometric and topological features. Next, we describe the proposed framework, which adapts the idea of edge contraction and space sweeping to decompose an object automatically. Finally, we demonstrate an application of this framework to improve bounding volume hierarchies constructed by state-of-theart collision detection systems such as RAPID and QuickCD.
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
Recognition-by-components: A theory of human image understanding.
Biederman, I. (1987) · Psychological Review · doi:10.1037/0033-295x.94.2.115 · Cited by 5,621
OBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Cited by
A survey on Mesh Segmentation Techniques
Shamir, A. (2008) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01103.x · Cited by 593
Hierarchical mesh decomposition using fuzzy clustering and cuts
Katz, S., & Tal, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882369 · Cited by 577
Skeleton based shape matching and retrieval
Sundar, H., Silver, D., Gagvani, N., & Dickinson, S. (2003) · 2003 Shape Modeling International. · doi:10.1109/smi.2003.1199609 · Cited by 560
Skeleton extraction by mesh contraction
Au, O. K.-C., Tai, C.-L., Chu, H.-K., Cohen-Or, D., & Lee, T.-Y. (2008) · ACM Transactions on Graphics · doi:10.1145/1360612.1360643 · Cited by 521
Curve-Skeleton Properties, Applications, and Algorithms
Cornea, N. D., Silver, D., & Min, P. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.1002 · Cited by 484
Metadata
- Authors
- Li, X., Woon, T. W., Tan, T. S., & Huang, Z.
- Venue
- Proceedings of the 2001 symposium on Interactive 3D graphics
- Publisher
- ACM
- Published
- 2001-03
- Pages
- 35-42
- OpenAlex
- W2075825658
- Cited by
- 185
- References
- 2
- FWCI
- 4.06
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Decomposing polygon meshes for interactive applications. https://app.cochat.ai/papers/10.1145/364338.364343
- The paper
- Li, X., Woon, T. W., Tan, T. S., & Huang, Z. (2001). Decomposing polygon meshes for interactive applications. Proceedings of the 2001 symposium on Interactive 3D graphics. https://doi.org/10.1145/364338.364343
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.