The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition
Abstract
The need to perform fast and accurate proximity queries arises frequently in physically-based modeling, simulation, animation, real-time interaction within a virtual environment, and game dynamics. The set of proximity queries include intersection detection, tolerance verification, exact and approximate minimum distance computation, and (disjoint) contact determination. Specialized data structures and algorithms have often been designed to perform each type of query separately. We present a unified approach to perform any of these queries seamlessly for general, rigid polyhedral objects with boundary representations which are orientable 2-manifolds. The proposed method involves a hierarchical data structure built upon a surface decomposition of the models. Furthermore, the incremental query algorithm takes advantage of coherence between successive frames. It has been applied to complex benchmarks and compares very favorably with earlier algorithms and systems.
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
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
Self-citationA fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Efficient collision detection using bounding volume hierarchies of k-DOPs
Klosowski, J. T., Held, M., Mitchell, J. S. B., Sowizral, H., & Zikan, K. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.675649 · Cited by 873
Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
Megiddo, N. (1983) · SIAM Journal on Computing · doi:10.1137/0212052 · Cited by 837
Linear-time algorithms for linear programming in R3 and related problems
Megiddo, N. (1982) · doi:10.1109/sfcs.1982.74 · Cited by 483
V-Clip: fast and robust polyhedral collision detection
Mirtich, B. (1998) · ACM Transactions on Graphics · doi:10.1145/285857.285860 · Cited by 403
Efficient distance computation between non-convex objects
Quinlan, S. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351059 · Cited by 391
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
Chazelle, B. (1984) · SIAM Journal on Computing · doi:10.1137/0213031 · Cited by 238
Efficient collision detection for animation and robotics
Lin, M. C., & Canny, J. (1993) · Cited by 231
Self-citationInteractive collision detection
Hubbard, P. M. (1993) · Proceedings of 1993 IEEE Research Properties in Virtual Reality Symposium · doi:10.1109/vrais.1993.378267 · Cited by 197
Linear programming and convex hulls made easy
Seidel, R. (1990) · Proceedings of the sixth annual symposium on Computational geometry - SCG '90 · doi:10.1145/98524.98570 · Cited by 166
Convex Decomposition of Polyhedra and Robustness
Bajaj, C. L., & Dey, T. K. (1992) · SIAM Journal on Computing · doi:10.1137/0221025 · Cited by 128
Strategies for polyhedral surface decomposition: An experimental study
Chazelle, B., Dobkin, D., Shouraboura, N., & Tal, A. (1997) · Computational Geometry · doi:10.1016/s0925-7721(96)00024-7 · Cited by 118
Accelerated proximity queries between convex polyhedra by multi-level Voronoi marching
Ehmann, S. A., & Lin, M. C. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.2000.895281 · Cited by 103
Self-citationH-Walk: hierarchical distance computation for moving convex bodies
Guibas, L. J., Hsu, D., & Zhang, L. (1999) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/304893.304979 · Cited by 57
THE EXTENDED CONVEX DIFFERENCES TREE (ECDT) REPRESENTATION FOR N-DIMENSIONAL POLYHEDRA
Rappoport, A. (1991) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195991000177 · Cited by 7
Cited by
Collision Detection for Deformable Objects
Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M. ‐., Faure, F., Magnenat‐Thalmann, N., Strasser, W., et al. (2005) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2005.00829.x · Cited by 507
Virtual reality for assembly methods prototyping: a review
Seth, A., Vance, J. M., & Oliver, J. H. (2011) · Virtual Reality · doi:10.1007/s10055-009-0153-y · Cited by 361
Metadata
- Authors
- Ehmann, S. A., & Lin, M. C.
- Venue
- Computer Graphics Forum
- Publisher
- Wiley
- Published
- 2001-09
- Volume
- 20
- Issue
- 3
- Pages
- 500-511
- ISSN
- 0167-7055 (ISSN-L)
- 1467-8659
- OpenAlex
- W2113525359
- Cited by
- 264
- References
- 16
- FWCI
- 32.76
- 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.