Determining the separation of preprocessed polyhedra — A unified approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 443 LNCS, Issue , 1990, Pages 400-413

  Dobkin, David P ^a   Kirkpatrick, David G ^b  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GEOMETRY; QUERY PROCESSING;

HIERARCHICAL REPRESENTATION; IMPLICIT REPRESENTATION; LINEAR TIME; SEPARATION PROBLEMS; UNIFIED APPROACH;

SEPARATION;

EID: 60749130749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032047     Document Type: Conference Paper

References (26)

1. Avis, D., El Gindy, H. and Seidel, R., A simple online algorithm for convex polyhedra, in Computational Geometry, G. Toussaint, ed., Springer Verlag, 1985, 23–42.
2. Chan, F. and Wang, C., Optimal algorithms for the intersection and the minimum distance problems between planar polygons, Technical Report TR-82-8, Department of Computer Science, University of Alberta, August, 1982.
3. Chazelle, B., An optimal algorithm for intersecting three-dimensional convex polyhedra, IEEE Sympos. on Found. of Comp. Sci. 30 (1989), 586–591.
4. Chazelle, B. and Dobkin, D. Detection is easier than computation, ACM Sympos. on Theory of Comput. 12 (1980), 146–153.
5. Chazelle, B. and Dobkin, D. Intersection of convex objects in two and three dimensions, JACM 34 (1987), 1–27.
6. Dadoun, N. and Kirkpatrick, D., Parallel construction of subdivision hierarchies, JCSS 39 (1989), 153–165.
7. Dadoun, N. and Kirkpatrick, D., Cooperative subdivisions algorithms with applications, Allerton Conference, 1989, to appear.
8. Dadoun, N., Kirkpatrick, D. and Walsh, J. The geometry of beam tracing, ACM Sympos. on Comp. Geom. 1 (1985), 55–61.
9. Dobkin, D. and Kirkpatrick, D., Fast detection of polyhedral intersections, Lecture Notes in Computer Science 140 (1982) 154–165.
10. Dobkin, D. and Kirkpatrick, D., Fast detection of polyhedral intersection, TCS 27 (1983), 241–253.
11. Dobkin, D. and Kirkpatrick, D., A linear algorithm for determining the separation of convex polyhedra, J. Algorithms 6 (1985) 381–392.
12. Dobkin, D. and Sonvaine, D., Detecting the intersection of convex objects in the plane, Princeton University Technical Report CS-TR-231-89, October, 1989.
13. Dobkin, D. and Souvaine, D., Detecting the intersection of convex objects in 3 dimensions, in preparation.
14. Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer Verlag, Berlin, 1987.
15. Edelsbrunner, H., Computing the extreme distance between two convex polygons, J. Algorithms 6 (1985), 213–224.
16. Edelsbrunner, H. and Maurer, H., Finding extreme points in three dimensions and solving the post-office problem in the plane, IPL 21 (1985), 39–47.
17. Grunbaum, B., Convex Polytopes, John Wiley & Sons, London, 1987.
18. Guibas, L., Ramshaw, L., and Stolfi, J., A kinetic framework for computational geometry, IEEE Sympos. Found. Comp. Sci. 24 (1983), 100–111.
19. Kirkpatrick, D., Optimal search in planar subdivisions, SIAM J. Comput. 12 (1983), 28–35.
20. Mehlhourn, K., Data Structures and Algorithms 3: Computational Geometry Springer Verlag, Berlin, 1984.
21. Mehlhourn, K. and Simon, K., Intersecting two polyhedra one of which is convex, Univ. Saarland Technical report, Saarbrucken, West Germany, 1986.
22. Mueller, D. and Preparata, F., Finding the intersection of two convex polyhedra, TCS 7 (1978) 217–236.
23. Preparata, F. and Hong, S., Convex hulls of finites sets of points in two and three dimensions, CACM 20 (1977), 87–93.
24. Preparata, F. and Shamos, M., Computational Geometry — an Introduction Springer Verlag, New York, NY, 1985.
25. Souvaine, D., Computational geometry in a curved world, Ph.D. dissertation, Princeton University, 1986.
26. Schwartz, J., Finding the minimum distance between two convex polygons, IPL 13 (1981), 168–170.