A projectively invariant intersection test for polyhedra

Visual Computer

Volumn 18, Issue 7, 2002, Pages 405-414

  Thomas, Federico ^a   Torras, Carme ^a  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

Author keywords

4 4 determinant method; Degenerate configurations; Intersection detection; Projective invariance

Indexed keywords

ALGORITHMS; ANIMATION; BOOLEAN ALGEBRA; COMPUTER GRAPHICS; COMPUTER HARDWARE; COMPUTER SIMULATION; DIGITAL LIBRARIES; ROBOTICS; VIRTUAL REALITY;

BOOLEAN FORMULA; INTERSECTION DETECTION; PROJECTIVE INVARIANCE;

COMPUTATIONAL GEOMETRY;

EID: 0036861735     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710100158     Document Type: Article

References (31)

1. Antonio F (1992) Faster line segment intersection. In: Kirk D (ed) Graphics Gems III. Academic Press, Boston, pp 199-202
2. Bloomenthal J, Rokne J (1994) Homogeneous coordinates. Visual Comput 10:176-187
3. Boyse JW (1979) Interference detection among solids and surfaces. Commun ACM 21:3-9
4. Bronnimann H, Yvinec M (2000) Efficient exact evaluation of signs of determinants. Algorithmica 27:21-52
5. Canny JF (1987) The complexity of robot motion planning. MIT Press, Cambridge, Mass.
6. Chubarev A (1999) Robust set operations on polyhedral solids: a fixed precision approach. Int J Comput Geom Appl 6:187-204
7. Edelsbrunner H, Mucke EP (1990) Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans Graph 9:66-104
8. Emiris IZ, Canny JF (1992) An efficient approach to removing geometric degeneracies. In: Proc. 8th ACM Symp. on Computational Geometry, Berlin, Germany, ACM Press, New York, USA, pp 74-82
9. Fortune S (1997) Polyhedral modelling with multiprecision integer arithmetic. Comput Aided Des 29:123-133
10. Haines E (1994) Point in polygon strategies. In: Heckbert P (ed) Graphics Gems IV. Academic Press, Boston, pp 24-46
11. Held M (1997) ERIT. A collection of efficient and reliable intersection tests. J Graph Tools 2:25-44
12. Hoffmann CM, Hopcroft JE, Karasick MS (1989) Robust set operations on polyhedral solids. IEEE Comput Graph Appl 9:50-59
13. Horn WP, Taylor DL (1989) A theorem to determine the spatial containment of a point in a planar polygon. Comput Vis Graph Image Process 45:106-116
14. Jiménez P, Thomas F, Torras C (2001) Collision detection: a survey. Comput Graph 25:269-285
15. Kalay YE (1982) Determining the spatial containment of a point in general polyhedra. Comput Graph Image Process 19:303-334
16. Lane J, Megedson B, Rarick M (1984) An efficient point in polyhedron algorithm. Comput Vis Graph Image Process 26:118-125
17. Lin MC, Gottschalk S (1998) Collision detection between geometric models: a survey. In: Gripps RJ (ed) 8th IMA Conf. on Mathematics of Surfaces, Birmingham, England, Information Geometers Press, pp 37-56
18. Möller T (1997) A fast triangle-triangle intersection test. J Graph Tools 2:25-30
19. Mount DM (1997) Geometric intersection. In: Goodman JE, O'Rourke J (eds) Handbook of Discrete and Computational Geometry. CRC Press, New York, pp 615-630
20. Niizeki M, Yamaguchi F (1994) Projectively invariant intersection detections for solid modelling. ACM Trans Graph 13:277-299
21. O'Rouke J (1998) Computational Geometry in C, 2nd edn. Cambridge University Press, Cambridge
22. Paeth AW (1990) A fast 2D point-on-line test. In: Glassner AS (ed) Graphics Gems I. Academic Press, Boston, pp 49-50
23. Pinto-Carvalho PC, Roma-Cavalcanti P (1994) Point in polyhedron testing using spherical polygons. In: Heckbert PS (ed) Graphics Gems IV. Academic Press, Boston, pp 42-49
24. Prasad M (1991) Intersection of line segments. In: Arvo J (ed) Graphics Gems II. Academic Press, Boston, pp 7-8
25. Requicha AAG, Voelcker HB (1982) Solid modeling: a historical summary and contemporary assessment. IEEE Comput Graph Appl 2:9-24
26. Seidel R (1998) The nature and meaning of perturbations in geometric computing. Discrete Comput Geom 19:1-17
27. Thomas SW (1991) Decomposing a matrix into simple transformations. In: Arvo J (ed) Graphics Gems II. Academic Press, Boston, pp 320-323
28. Thomas F, Torras C (1994) Interference detection between non-convex polyhedra revisited with a practical aim. In: IEEE Int. Conf. on Robotics and Automation, San Diego, CA, IEEE Press, pp 587-594
29. Yamaguchi F (1988) Applications of the 4×4 determinant method and the polygon engine. Visual Comput 4:176-187
30. Yamaguchi F (1998) A shift of playground for geometric processing from Euclidean to homogeneous. Visual Comput 14:315-327
31. Yamaguchi F, Niizeki M (1997) Some basic geometric test conditions in terms of Plücker coordinates and Plücker coefficients. Visual Comput 13:29-41