| [1] |
Pankaj Agarwal and Micha Sharir.
Red-blue intersection detection algorithms, with applications to
motion planning and collision detection.
19(2):297-321, April 1990. [ bib ] |
| [2] |
Pankaj Agarwal.
Partitioning arrangements of lines. ii: Applications.
5:533-573, 1990. [ bib ] |
| [3] |
Pankaj Agarwal.
Partitioning arrangements of lines. i: An efficient deterministic
algorithm.
5:449-483, 1990. [ bib ] |
| [4] |
Alok Aggarwal, Bernard Chazelle, Leo Guibas, Colm Ó'Dúnlaing, and Chee
Yap.
Parallel computational geometry.
In Proceedings IEEE Symposium on FOundations on Computer
Science, pages 468-477, 1985. [ bib ] |
| [5] |
N. Ahuja, R. T. Chien, R. Yen, and N. Bridwell.
Interference detection and collision avoidance among three
dimensional objects.
In I Annual National Conference on AI, pages 44-48. Stanford
University, August 1980. [ bib ] |
| [6] |
Nancy M. Amato.
Determining the separation of simple poligons.
4(4):457-474, 1994. [ bib ] |
| [7] |
Mikhail J. Atallah and Danny Z. Chen.
On parallel rectilinear obstacle-avoiding paths.
3:307-313, 1993. [ bib ] |
| [8] |
Mikhail J. Atallah, Celso C. Ribeiro, and Sergio Lifschitz.
Computing some distance functions between polygons.
24(8):775-781, 1991. [ bib ] |
| [9] |
F. Avnaim.
Evaluating signs of determinants using single-precision arithmetic.
Technical Report 2306, INRIA, 1994. [ bib ] |
| [10] |
Ivan Balaban.
An optimal algorithm for finding segments intersections.
In 11th ACM Comput. geom., pages 211-219, 1995. [ bib ] |
| [11] |
Srikanth Bandi and Daniel Thalmann.
An adaptive spatial subdivision of the object space for fast
collision detection of animating rigid bodies.
In Eurographics'95, pages 259-270. Maastricht, August 1995. [ bib ] |
| [12] |
Julien Basch, Leonidas J. Guibas, and G. D. Ramkumar.
Reporting red-blue intersections between connected sets of line
segments.
In 4th European Symposium on Algorithms, pages 302-319, 1996. [ bib ] |
| [13] |
Julien Basch, Leonidas J. Guibas, G. D. Ramkumar, and Lyle Ramshaw.
Polyhedral tracings and their convolution.
In Workshop on Algorithmic Foundations of Robotics, 1996. [ bib ] |
| [14] |
Jon L. Bentley and Thomas A. Ottmann.
Algorithms for reporting and counting geometric intersections.
28(9):643-647, September 1979. [ bib ] |
| [15] |
Gino van der Bergen.
Efficient collision detection of complex deformable models using aabb
trees.
Journal of Graphic Tools, 2(4):1-13, 1997. [ bib ] |
| [16] |
Gino van der Bergen.
A fast and robust gjk implementation for collision detection of
convex objects.
submitted, available at http://www.win.tue.nl/cs/tt/gino/solid,
1999. [ bib ] |
| [17] |
Gino Van der Bergen.
EUCLID. C Library for Interference Detection, 1997.
Preprint available at http://www.win.tue.nl/cs/tt/gino/euclid. [ bib ] |
| [18] |
M. A. Bickerstaff and G. R. Hellestrand.
A highly parallel architecture for real time collision detection in
flight simulation.
Comput. & Graphics, 15(3):355-363, 1991. [ bib ] |
| [19] |
James F. Blinn.
A trip down the graphics pipeline: line clipping.
IEEE Computer Graphics and Applications, January 1991. [ bib ] |
| [20] |
James E. Bobrow.
A direct optimization approach for obtaining the distance between
convex polyhedra.
8(3):65-76, June 1983. [ bib ] |
| [21] |
Susan Bonner and Robert B. Kelley.
A representation scheme for rapid 3-d collision detection.
In Proc. IEEE International Symposium on Intelligent Control,
pages 320-325, Arlington (VA), August 1988. [ bib ] |
| [22] |
W. Bouma and George Vanecek.
Collision detection and analysis in a physical based simulation.
In Eurographics Workshop on Animation and Simulation, pages
191-203, Vienna, September 1991. [ bib ] |
| [23] |
John W. Boyse.
Interference detection among solids and surfaces.
22(1):3-9, January 1979. [ bib ] |
| [24] |
Stephen A. Cameron.
A study of the clash detection problem in robotics.
volume 1, pages 488-493, Saint Louis (MO), March 1985. [ bib ] |
| [25] |
Stephen A. Cameron.
Efficient intersection tests for objects defined constructively.
8:3-25, February 1989. [ bib ] |
| [26] |
Stephen A. Cameron.
Collision detection by four-dimensional intersection testing.
6(3):291-302, June 1990. [ bib ] |
| [27] |
Stephen A. Cameron.
Efficient bounds in constructive solid geometry.
IEEE Computer Graphics and Applications, 11(3):68-74, May
1991. [ bib ] |
| [28] |
Stephen A. Cameron.
A comparison of two fast algorithms for computing the distance
between convex polyhedra.
13:915-920, December 1997. [ bib ] |
| [29] |
Stephen A. Cameron.
Enhancing gjk: Computing minimum and penetration distances between
convex polyhedra.
pages 3112-3117, Albuquerque (NM), April 1997. [ bib ] |
| [30] |
Stephen A. Cameron and R. K. Culley.
Determining the minimum translational distance between two convex
polyhedra.
Number 1, pages 591-596, San Francisco (CA), April 1986. [ bib ] |
| [31] |
John F. Canny.
Collision detection for moving polyhedra.
8(2):200-209, March 1986. [ bib ] |
| [32] |
Ingrid Carlbom.
An algorithm for geometric set operations using cellular subdivision
techniques.
IEEE Computer Graphics and Applications, 7:44-55, May 1987. [ bib ] |
| [33] |
Timothy M. Chan.
A simple trapezoid sweep algorithm for reporting red/blue segment
intersections.
In 6th Canadian Conference on Comput. Geom., pages 263-268,
1994. [ bib ] |
| [34] |
Timothy M. Chan.
Dynamic planar convex hull operations in near-logarithmic amortized
time.
In IEEE Symposium on Foundations of Computer Science, pages
92-99, 1999. [ bib | .html ] |
| [35] |
Bernard Chazelle.
An optimal algorithm for intersecting three-dimensional convex
polyhedra.
21(4):671-696, August 1992. [ bib ] |
| [36] |
Bernard Chazelle and Herbert Edelsbrunner.
An optimal algorithm for intersecting line segments in the plane.
Journal of the ACM, 39(1):1-54, January 1992. [ bib ] |
| [37] |
Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, and Micha Sharir.
Algorithms for bichromatic line segment problems and polyhedral
terrains.
Algorithmica, 11:116-132, 1994. [ bib ] |
| [38] |
Francis Chin and Cao An Wang.
Optimal algorithms for the intersection and the minimum distance
problems between planar polygons.
32(12):1203-1207, December 1983. [ bib ] |
| [39] |
Yong J. Choi, Carl D. Crane-III, and Gary K. Matthew.
Obstacle avoidance via articulation.
8(4):465-484, 1991. [ bib ] |
| [40] |
Kelvin Chung.
An efficient collision detection algorithm for polytopes in virtual
environments.
Master's thesis, The University of Hong Kong, 1996.
http://www.cs.hku.hk /~tlchung /collision_library.html. [ bib ] |
| [41] |
Kelvin Chung and Wenping Wang.
Quick collision detection of polytopes in virtual environments.
In Proceedings of ACM Symp. on Virtual Reality Software and
Technology, pages 1-4, July 1996.
http://www.cs.hku.hk /~tlchung /collision_library.html. [ bib ] |
| [42] |
Johnatan D. Cohen, Ming C. Lin, Dinesh Manocha, and Madhav K. Ponamgi.
I-collide: An interactive and exact collision detection system for
large-scale environments.
In Proceedings of ACM Int. 3D Graphics Conference, volume 1,
pages 189-196, 1995.
http://www.cs.unc.edu /~geom /I_COLLIDE.html. [ bib ] |
| [43] |
David E. Johnson and Elaine Cohen.
Spatialized normal cone hierarchies.
In ACM Symposium on Interactive 3D Graphics, ACM SIGGRAPH,
March 2001. [ bib | .html ] |
| [44] |
K. L. Clarkson and P. W. Shor.
Applications of random sampling in computational geometry, ii.
4:387-421, 1989. [ bib ] |
| [45] |
D. Johnson and E. Cohen.
Spatialized normal cone hierarchies.
In Proc. 2001 ACM Symposium on Interactive 3D Graphics,
volume 2, pages 129-134, Research Triangle Park, (NC), March 2001. [ bib ] |
| [46] |
R. K. Culley and K. G. Kempf.
A collision detection algorithm based on velocity and distance
bounds.
volume 2, pages 1064-1069, San Francisco (CA), April 1986. [ bib ] |
| [47] |
Begoña Martínez, Angel P. del Pobil, and Miguel Pérez.
Very fast collision detection for practical motion planning. part i:
The spatial representation.
volume 1, pages 624-629, Leuven (Belgium), May 1998. [ bib ] |
| [48] |
Begoña Martínez, Angel P. del Pobil, and Miguel Pérez.
Very fast collision detection for practical motion planning. part ii:
The parallel algorithm.
volume 1, pages 644-649, Leuven (Belgium), May 1998. [ bib ] |
| [49] |
Angel P. del Pobil, Miguel A. Serna, and Juan Llovet.
A new representation for collision avoidance and detection.
volume 1, pages 246-251, Nice (France), May 1992. [ bib ] |
| [50] |
David Dobkin and David Kirkpatrick.
Fast detection of polyhedral intersections.
140:154-165, 1982. [ bib ] |
| [51] |
David Dobkin and David Kirkpatrick.
A linear algorithm for determining the separation of convex
polyhedra.
6:381-392, 1985. [ bib ] |
| [52] |
David Dobkin and David Kirkpatrick.
Determining the separation of preprocessed polyhedra -a unified
approach.
volume 443 (ICALP-90), pages 400-413, 1990. [ bib ] |
| [53] |
David P. Dobkin and Herbert Edelsbrunner.
Space searching for intersecting objects.
In Proceedings IEEE Symposium on FOundations on Computer
Science, pages 387-392, 1984. [ bib ] |
| [54] |
Katrin Dobrindt, Kurt Mehlhorn, and Mariette Yvinec.
A complete and efficient algorithm for the intersection of a general
and a convex polyhedron.
Technical Report 2023, INRIA, September 1993. [ bib ] |
| [55] |
Andre Foisy, Vincent Hayward, and Stephane Aubry.
The use of awareness in collision prediction.
volume 1, pages 338-343, Cincinnati (OH), 1990. [ bib ] |
| [56] |
Andre Foisy and Vincent Hayward.
A safe swept volume method for collision detection.
In The Sixth International Symposium of Robotics Research,
pages 61-68, Pittsburgh (PE), October 1993. [ bib ] |
| [57] |
Paul Heckbert.
Graphic Gems IV.
Academic Press, 1994. [ bib ] |
| [58] |
Alejandro García-Alonso, Nicolás Serrano, and Juan Flaquer.
Solving the collision detection problem.
IEEE Computer Graphics and Applications, 14(3):36-43, May
1994. [ bib ] |
| [59] |
Elmer G. Gilbert, Daniel W. Johnson, and Sathiya Keerthi.
A fast procedure for computing the distance between complex objects
in three dimensional space.
4(2):193-203, April 1988. [ bib ] |
| [60] |
Elmer G. Gilbert and Chek-Peng Foo.
Computing the distance between general convex objects in
three-dimensional space.
6(1):53-61, 1990. [ bib ] |
| [61] |
Elmer G. Gilbert and S. M. Hong.
A new algorithm for detecting the collision of moving objects.
volume 1, pages 8-14, Scottsdale (AR), May 1989. [ bib ] |
| [62] |
Elmer G. Gilbert and Chong Jin Ong.
New distances for the separation and penetration of objects.
volume 1, pages 579-586, San Diego (CA), May 1994. [ bib ] |
| [63] |
S. Gottschalk, M. C. Lin, and D. Manocha.
Obb-tree: A hierarchical structure for rapid interference detection.
In Proc. of ACM Siggraph'96, pages 171-180, New Orleans (LA),
1996.
http://www.cs.unc.edu /~geom/OBB /OBBT.html. [ bib ] |
| [64] |
A. Gregory, M. C. Lin, S. Gottschalk, and R. Taylor.
Fast and accurate collision detection for haptic interaction using a
three degree-of-freedom force-feedback device.
To appear in Computational Geometry: Theory and Applications. [ bib ] |
| [65] |
L. Guibas and R. Seidel.
Computing convolution by reciprocal search.
In Proc. of the ACM Symp. on Comp. Geom., Yorktown Heights
(NY), 1986. [ bib ] |
| [66] |
Gregory J. Hamlin, Robert B. Kelley, and Josep Tornero.
Efficient distance calculation using the spherically-extended
polytope (s-tope) model.
volume 3, pages 2502-2507, Nice (France), May 1992. [ bib ] |
| [67] |
Vincent Hayward.
Fast collision detection scheme by recursive decomposition of a
manipulator workspace.
volume 2, pages 1044-1049, San Francisco (CA), 1986. [ bib ] |
| [68] |
Dominik Henrich and Xiaoqing Cheng.
Fast distance computation for on-line collision detection with
multi-arm robots.
volume 3, pages 2514-2519, Nice (France), May 1992. [ bib ] |
| [69] |
M. Held, J. T. Klosowski, and J.S.B. Mitchell.
Evaluation of collision detection methods for virtual reality
fly-throughs.
In Proc. Seventh Canadian Conf. Computer Geometry, volume 3,
pages 205-210, 1995. [ bib ] |
| [70] |
J. E. Hopcroft, J. T. Schwartz, and M. Sharir.
Efficient detection of intersections among spheres.
Int. Journal of Robotics Research, 2(4):77-80, 1983. [ bib ] |
| [71] |
Phillip M. Hubbard.
Interactive collision detection.
In Proc. IEEE Symp. on Research Frontiers in Virtual Reality,
volume 1, pages 24-31, October 1993. [ bib ] |
| [72] |
Phillip M. Hubbard.
Real-time collision detection and time-critical computing.
In Proc. First ACM Workshop on Simulation and Interaction in
Virtual Environments, volume 1, pages 92-96, 1995. [ bib ] |
| [73] |
Phillip M. Hubbard.
Collision detection for interactive graphics applications.
IEEE Transactions on Visualization and Computer Graphics,
1(3):218-230, 1995. [ bib ] |
| [74] |
Thomas C. Hudson, Ming C. Lin, Johnatan D. Cohen, Stefan Gottschalk, and Dinesh
Manocha.
V-collide: Accelerated collision detection for vrml.
In Proceedings of VRML, 1997.
http://www.cs.unc.edu/~geom/V_COLLIDE .html. [ bib ] |
| [75] |
Merlin Hughes, Christopher DiMattia, Ming C. Lin, and Dinesh Manocha.
Efficient and accurate interference detection for polinomial
deformation.
In Proceedings of Computer Animation '96 Conference, 1996. [ bib ] |
| [76] |
Ravi Janardan and Mario Lopez.
Generalized intersection searching problems.
International Journal of Computational Geometry and
Applications, 3(1):39-69, 1993. [ bib ] |
| [77] |
Katsuaki Kawachi and Hiromasa Suzuki.
Distance computation between non-convex polyhedra at short range
based on discrete voronoi regions.
In Proc. IEEE Geometric Modeling and Processing 2000 (Theory and
Applications), pages 123-128, Hong Kong (China), April 2000. [ bib ] |
| [78] |
J.T. Klosowski, M. Held, J.S.B. Mitchell, H. Sowizral, and K. Zikan.
Efficient collision detection using bounding volume hierarchies of
k-dops.
IEEE Transactions on Visualization and Computer Graphics,
4(1):21-36, 1998. [ bib ] |
| [79] |
S. Krishnan, M. Gopi, M. Lin, D. Manocha, and A. Pattekar.
Rapid and accurate contact determination between spline models using
shelltrees.
In Eurographics'98, Leeds (UK), March 1998. [ bib ] |
| [80] |
Tsuneya Kurihara, Ken ichi Anjyo, and Daniel Thalmann.
Hair animation with collision detection.
In Computer Animation'93, pages 128-138, Tokyo (Japan), 1993. [ bib ] |
| [81] |
K. J. Kyriakopoulos and G. N. Saridis.
Minimum distance estimation and collision prediction under
uncertainty for on-line robotic motion planning.
In 11th IFAC World Congress, volume 1, pages 93-98, Tallinn
(Estonia), 1990. [ bib ] |
| [82] |
Sukhamay Kundu.
A new o(n log n) algorithm for computing the intersection of convex
polygons.
20(4):419-424, 1987. [ bib ] |
| [83] |
Benoit Lafleur, Nadia Magnenat Thalmann, and Daniel Thalmann.
Cloth animation with self-collision detection.
In IFIP Conference on Graphics Modeling, Tokyo (Japan), 1991. [ bib ] |
| [84] |
Eric Larsen, Stefan Gottschalk, Ming Lin, and Dinesh Manocha.
Fast proximity queries with swept sphere volumes.
Technical Report TR99-018, Dep. of Comp. Sci., UNC Chapel Hill, 1999.
http://www.cs.unc.edu/~geom/SSV/. [ bib | www ] |
| [85] |
Ming C. Lin.
Efficient Collision Detection for Animation and Robotics.
PhD thesis, University of California, Berkeley, 1993. [ bib ] |
| [86] |
Ming C. Lin and John F. Canny.
A fast algorithm for incremental distance calculation.
volume 2, pages 1008-1014, Sacramento (CA), 1991. [ bib ] |
| [87] |
Ming C. Lin and John F. Canny.
An efficient algorithm for incremental distance computation.
(unpublished). [ bib ] |
| [88] |
Ming C. Lin, Dinesh Manocha, and John F. Canny.
Fast contact determination in dynamic environments.
volume 1, pages 602-608, San Diego (CA), May 1994. [ bib ] |
| [89] |
Ming C. Lin and Stefan Gottschalk.
Collision detection between geometric models: a survey.
In IMA Conference on Mathematics of Surfaces, volume 1, pages
602-608, San Diego (CA), May 1998. [ bib ] |
| [90] |
Yun-Hui Liu, Suguru Arimoto, and Hiroshi Noborio.
A new solid model hsm and its application to interference detection
between moving objects.
8(1):39-54, 1991. [ bib ] |
| [91] |
H. G. Mairson and J. Stolfi.
Theoretical Foundations of Computer Graphics and CAD, volume
F40, chapter Reporting and counting intersections between two sets of line
segments, pages 307-325.
1988. [ bib ] |
| [92] |
N. Megiddo and A. Tamir.
Linear time algorithms for some separable quadratic programming
problems.
Operations Research Letters, 13(4):203-211, 1993. [ bib ] |
| [93] |
Kurt Mehlhorn, Micha Sharir, and E. Welzl.
Tail estimates for the efficiency of randomized incremental
algorithms for line segment intersection.
3:235-246, 1993. [ bib ] |
| [94] |
Kurt Mehlhorn and Klaus Simon.
Intersecting two polyhedra one of which is convex.
Fundamentals of Computation Theory 85(199):534-542, 1985. [ bib ] |
| [95] |
Walter Meyer.
Distance between boxes: applications to collision detection and
clipping.
volume 1, pages 597-602, San Francisco (CA), April 1986. [ bib ] |
| [96] |
Brian Mirtich.
V-clip: Fast and robust polyhedral collision detection.
ACM Transactions on Graphics, 17(3):177-208, 1998.
http://www.merl.com/projects/vclip/. [ bib ] |
| [97] |
Brian Mirtich and John Canny.
Impulse-based dynamic simulation.
In Proc. Workshop on Algorithmic Foundations of Robotics, 1994. [ bib ] |
| [98] |
Matthew Moore and Jane Wilhelms.
Collision detection and response for computer animation.
22(4):289-298, 1988. [ bib ] |
| [99] |
Wyatt S. Newman and Michael S. Branicky.
Real-time configuration space transforms for obstacle avoidance.
10(6):650-667, December 1991. [ bib ] |
| [100] |
B. John Oommen and Irwin Reichstein.
On translating ellipses amidst elliptic obstacles.
volume 3, pages 1755-1760, San Francisco (CA), 1986. [ bib ] |
| [101] |
Joseph O'Rourke and Norman Badler.
Decomposition of three dimensional objects into spheres.
1(3):295-305, 1979. [ bib ] |
| [102] |
Mark Overmars.
Point location in fat subdivisions.
Information Processing letters, 44:261-265, 1992. [ bib ] |
| [103] |
Larry Palazzi and Jack Snoeyink.
Counting and reporting red/blue segment intersections.
volume Proc. 3rd Workshop Algorithms Data Struct., pages 530-540,
1993. [ bib ] |
| [104] |
I. J. Palmer and R. L. Grimsdale.
Collision detection for animation using sphere-trees.
Computer Graphics Forum, 14(2):105-116, 1995. [ bib ] |
| [105] |
Madhav K. Ponamgi, Dinesh Manocha, and Ming C. Lin.
Incremental algorithms for collision detection between solid models.
In Proceedings of ACM/Siggraph Symposium on Solid Modelling,
volume 1, pages 293-304, 1995. [ bib ] |
| [106] |
Madhav K. Ponamgi, Dinesh Manocha, and Ming C. Lin.
Incremental algorithms for collision detection between polygonal
models.
IEEE Trans. on Visualization and Comp. Graphics, 3(1):51-64,
1997. [ bib ] |
| [107] |
Jean Ponce and Olivier Faugeras.
Object centered hierarchical representation for 3d objects: the prism
tree.
Computer Vision, Graphics, and Image Processing, 38(1):1-28,
April 1987. [ bib ] |
| [108] |
F. P. Preparata and D. E. Muller.
Finding the intersection of n half-spaces in time o(n log n).
Theor. Appl. Fract. Mech., 8:45-55, 1979. [ bib ] |
| [109] |
Sean Quinlan.
Efficient distance computation between non-convex objects.
volume 4, pages 3324-3329, San Diego (CA), 1994. [ bib ] |
| [110] |
Elon Rimon and Stephen P. Boyd.
Efficient distance computation using best ellipsoid fit.
In Proc. 1992 Int. Symp. on Intelligent Control, pages
360-365, Glasgow, Scotland (UK), August 1992. [ bib ] |
| [111] |
Elon Rimon and Stephen P. Boyd.
Obstacle collision detection using best ellipsoid fit.
Journal of Intelligent and Robotic Systems, 18:105-126, 1997. [ bib ] |
| [112] |
N. K. Sancheti and S. S. Keerthi.
Computation of certain measures of proximity between convex
polytopes: a complexity viewpoint.
volume 3, pages 2508-2513, Nice (France), May 1992. [ bib ] |
| [113] |
Elmar Schömer and Christian Thiel.
Efficient collision detection for moving polyhedra.
In Proc. of the Eleventh Annual Symp. on Computational
Geometry, pages 51-60, 1995. [ bib ] |
| [114] |
John M. Snyder, Adam R. Woodbury, Kurt Fleischer, Bena Currin, and Alan H.
Barr.
Interval methods for multi-point collisions between time-dependent
curved surfaces.
In Proc. of ACM Siggraph, pages 321-334, 1993. [ bib ] |
| [115] |
Gino van der Bergen.
SOLID. Software Library for Interference Detection, 1999.
Available at http://www.win.tue.nl/cs/tt/gino/solid. [ bib ] |
| [116] |
A. James Steward.
Local robustness and its application to polyhedral intersection.
International Journal of Computational Geometry and
Applications, 4(1):87-118, 1994. [ bib ] |
| [117] |
David Strip and Michael Karasick.
A simd algorithm for intersecting three-dimensional polyhedra.
SIAM News, 27(2), March 1994. [ bib ] |
| [118] |
Robert Bruce Tilove.
Set membership classification: a unified approach to geometric
intersection problems.
29(10):874-883, October 1980. [ bib ] |
| [119] |
William C. Thibault and Bruce F. Naylor.
Set operations on polyhedra using binary space partitioning trees.
21(4):153-162, 1987. [ bib ] |
| [120] |
Bruce F. Naylor, J. A. Amatodes, and William C. Thibault.
Merging bsp trees yields polyhedral set operations.
In Computer Graphics (SIGGRAPH´90 Proc.), volume 24, pages
115-124, Dallas (TX), May 1990. [ bib ] |
| [121] |
Nadia Magnenat Thalmann, Stephane Carion, Martin Courchesne, Pascal Volino, and
Yin Wu.
Virtual clothes, hair and skin for beautiful top models.
In Computer Graphics Int.'96, IEEE Comp. Soc. Press, pages
132-141, Pohang (Korea), June 1996. [ bib ] |
| [122] |
Federico Thomas and Carme Torras.
Interference detection between non-convex polyhedra revisited with a
practical aim.
volume 1, pages 587-594, San Diego (CA), May 1994. [ bib ] |
| [123] |
Federico Thomas.
An approach to the movers problem that combines oriented matroid
theory and algebraic geometry.
volume 3, pages 2285-2293, Nagoya (J), May 1995. [ bib ] |
| [124] |
Federico Thomas and Carme Torras.
A group theoretic approach to the computation of symbolic parts
relations.
4(6):622-634, December 1988. [ bib ] |
| [125] |
Federico Thomas, Colin Turnbull, Lluis Ros, and Stephen Cameron.
Computing signed distances between free-form objects.
San Francisco (CA), April 2000. [ bib ] |
| [126] |
J. Tornero, J. Hamlin, and R. B. Kelley.
Spherical-object representation and fast distance computation for
robotic applications.
volume 2, pages 1602-1608, Sacramento (CA), April 1991. [ bib ] |
| [127] |
Greg Turk.
Interactive collision detection for molecular graphics.
Master's thesis, University of North Carolina, 1989. [ bib ] |
| [128] |
Colin Turnbull and Stephen Cameron.
Computing distances between nurbs-defined convex objects.
pages 3686-3690, Leuven (Belgium), May 1998. [ bib ] |
| [129] |
T. Uchiki, T. Ohashi, and M. Ohoro.
Collision detection in motion simulation.
Computers and Graphics, 7(3-4):285-293, 1983. [ bib ] |
| [130] |
George Vanecek.
Back-face culling applied to collision detection of polyhedra.
Journal of Visualization and Computer Animation, 5(1):55-63,
January-March 1994. [ bib ] |
| [131] |
Pascal Volino and Nadia Magnenat Thalmann.
Efficient self-collision detection on smoothly discretized surface
animations using geometrical shape regularity.
In Eurographics'94, Computer Graphics Forum, volume 13, pages
155-166, Oslo (Norway), 1994. [ bib ] |
| [132] |
Pascal Volino and Nadia Magnenat Thalmann.
Collision and self-collision detection: efficient and robust
solutions for highly deformable surfaces.
In Eurographics Workshop on Computer Animation ans
Simulation'95, Maastricht (The Netherlands), 1995. [ bib ] |
| [133] |
Pascal Volino, Martin Courchesne, and Nadia Magnenat Thalmann.
Versatile and efficient techniques for simulating cloth and other
deformable objects.
In Siggraph'95, Computer Graphics 29, pages 137-144, 1995. [ bib ] |
| [134] |
Pascal Volino and Nadia Magnenat Thalmann.
The evolution of a 3d system for simulating deformable clothes on
virtual actors.
IEEE Computer Graphics and Applications, 16(5):42-51,
September 1996. [ bib ] |
| [135] |
Brian Von Herzen, Alan H. Barr, and Harold R. Zatz.
Geometric collisions for time-dependent parametric surfaces.
24(4):39-48, August 1990. [ bib ] |
| [136] |
A. Wilson, E. Larsen, D. Manocha, and M. C. Lin.
Partitioning and handling massive models for interactive collision
detection.
In P. Brunet and R. Scopigno, editors, Computer Graphics Forum
(Eurographics '99), volume 18(3), pages 319-330. The Eurographics
Association and Blackwell Publishers, 1999. [ bib | .html ] |
| [137] |
S. Zeghloul, P. Rambeaud, and J. P. Lallemand.
A fast distance calculation between convex objects by optimization
approach.
volume 3, pages 2520-2525, Nice (France), May 1992. [ bib ] |
| [138] |
S. Zeghloul and P. Rambeaud.
Comment on `a direct minimization approach for obtaining the distance
between convex polyhedra' by james e. bobrow.
11(5):499-501, October 1992. [ bib ] |
| [139] |
Jingfang Zhou, Evan C. Sherbrooke, and Nicholas M. Patrikalakis.
Computation of stationary points of distance functions.
9:231-246, 1993. [ bib ] |
| [140] |
Dan Halperin.
Robust geometric computing in motion. [ bib | .html ] |
| [141] |
Yuval Aharoni, Dan Halperin, Iddo Hanniel, Sariel Har-Peled, and Chaim Linhart.
On-line zone construction in arrangements of lines in the plane.
volume Proc. 3rd Workshop on Algorithm Engineering (WAE'99), pages
139-153, London (UK), 1999. [ bib | .html ] |
| [142] |
S. Har-Peled and M. Sharir.
Line point location in planar arrangements and its applications.
In Proc. 12th ACM-SIAM Sympos. Discrete Algorithms, volume 1,
pages 57-66, Washington (DC), January 2001. [ bib | .html ] |