Separation and approximation of polyhedral objects

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 296-306

  Mitchell, Joseph S B ^a   Suri, Subhash ^b  

^a STONY BROOK UNIVERSITY   (United States)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; SEPARATION;

CONVEX POLYHEDRAL; CONVEX POLYHEDRONS; EFFICIENT APPROXIMATION ALGORITHMS; HIGHER DIMENSIONS; INTEGER PARAMETERS; POLYHEDRAL OBJECTS; POLYHEDRAL SURFACE; SEPARATION PROBLEMS;

GEOMETRY;

EID: 85025269771     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri and C. K. Yap. "Finding minimal convex nested polygons, " Information and Control, 83, pp. 98-110, 1989.
2. R. Bar-Yehuda, B. Chazelle, and R. Grinwald. "An 0(n + h log1+l ft)-time algorithm to merge h simple polygons" Manuscript, Computer Science Dept., Technion, Israel, 1991.
3. T. Corman, C. Leiserson and R. Riyest. Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1990.
4. G. Das. "Approximation schemes in computational geometry, " Ph.D. Thesis, University of Wisconsin, 1990.
5. G. Das and D. Joseph. "Minimum vertex hulls for polyhedral domains, " Symposium on Theoretical Aspects of Computer Science, 1990, LNCS, Springer-Verlag.
6. G. Das and D. Joseph. "The complexity of minimum convex nested polyhedra, " Canadian Conference on Computational Geometry, 1990.
7. D. Dobkin and D. Kirkpatrick. "Determining the separation of preprocessed polyhedra- a unified approach, " Proc. of IC ALP '90, pp. 400-413, 1990.
8. M. E. Dyer. "On a multidimensional search technique and its application to the Euclidean one-center problem, " SIAM J. of Computing, 15, pp. 725-738, 1986.
9. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.
10. H. Edelsbrunner and F. P. Preparata. "Minimum polygon separation, " Information and Computation, 77, pp. 218-232, 1987.
11. H. Edelsbrunner, A. D. Robinson and X. Shen. "Covering convex sets with non-overlapping polygons, " Discrete Mathematics, 81, pp. 153-164, 1990.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
13. L. J. Guibas, J. E. Hershberger, J. S. B. Mitchell, and J. S. Snoeyink. "Approximating polygons and subdivisions with minimum link paths, " To appear, Second Annual International Symposium on Algorithms, December 16-18, 1991, Taipei, Taiwan, R.O.C.
14. D.S.Johnson. "Approximation algorithms for combinatorial problems, " Journal of Computer and System Sciences, 256-278, 1974.
15. L. Lovász. "On the ratio of optimal integral and fractional covers, " Discrete Mathematics, 383-390, 1974.
16. N. Megiddo. "Linear programming in linear time when the dimension is fixed, " JACM, 12, pp. 114127, 1984.
17. N. Megiddo. "On the complexity of polyhedral separability, " Discrete and Computational Geometry, pp. 325-337, 1988.
18. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag, New York, 1985.
19. C. B. Silio. "An efficient simplex coverability algorithm in E2 with application to stochastic sequential machines, " IEEE Transactions on Computers, C-28, pp. 109-120, 1979.
20. S. Suri. "On some link distance problems in a simple polygon." IEEE Transactions on Robotics and Automation, 6 (1), pp. 108-113, 1990.
21. C. A. Wang and E. Chan. "Finding the minimum visible vertex distance between two non-intersecting simple polygons, " Proc. of 2nd Symposium on Computational Geometry, pp. 34-42, 1986.