Skip to main content
SpringerLink
Log in

On the complexity of approximating and illuminating three-dimensional convex polyhedra

Preliminary version

  • Invited Presentation
  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 955))

Included in the following conference series:

Abstract

We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.

This research supported in part by NSF Grant CCR-9306822.

This research supported by the NSF under Grants IRI-9116843 and CCR-9300079.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. K. Agarwal and S. Suri. Surface approximation and geometric partitions. In Proc. Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994.

    Google Scholar 

  2. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, and C. K. Yap. Finding minimal convex nested polygons. Inform. Comput., 83(1):98–110, October 1989.

    Article  Google Scholar 

  3. A. Blum and R. L. Rivest. Training a 3-node neural net is NP-Complete. Neural Networks, 5:117–127, 1992.

    Google Scholar 

  4. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 293–302, 1994.

    Google Scholar 

  5. K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 246–252, 1993.

    Google Scholar 

  6. G. Das. Approximation schemes in computational geometry. Ph.D. thesis, University of Wisconsin, 1990.

    Google Scholar 

  7. G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Proc. 2nd Canad. Conf. Comput. Geom., pages 296–301, 1990.

    Google Scholar 

  8. G. Das and D. Joseph. Minimum vertex hulls for polyhedral domains. Theoret. Comput. Sci., 103:107–135, 1992.

    Article  Google Scholar 

  9. D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27:241–253, 1983.

    Article  Google Scholar 

  10. H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.

    Google Scholar 

  11. M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32:826–834, 1977.

    Article  Google Scholar 

  12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.

    Google Scholar 

  13. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.

    Article  Google Scholar 

  14. B. Grünbaum. Convex Polytopes. Wiley, New York, NY, 1967.

    Google Scholar 

  15. L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15–17, 1976.

    Article  Google Scholar 

  16. S. Judd. On the complexity of loading shallow neural networks. J. of Complexity, 4:177–192, 1988.

    Article  Google Scholar 

  17. D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28–35, 1983.

    Article  Google Scholar 

  18. N. Megiddo. On the complexity of polyhedral separability. Discrete Comput. Geom., 3:325–337, 1988.

    Google Scholar 

  19. J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral surfaces. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 296–306, 1992.

    Google Scholar 

  20. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987.

    Google Scholar 

  21. J. O'Rourke. Computational geometry column 4. SIGACT News, 19(2):22–24, 1988. Also in Computer Graphics 22(1988), 111–112.

    Article  Google Scholar 

  22. C. B. Silio, Jr.. An efficient simplex coverability algorithm in E 2 with applications to stochastic sequential machines. IEEE Trans. Comput., C-28:109–120, 1979.

    Google Scholar 

  23. E. Steinitz and H. Rademacher. Vorlesungen über die Theorie der Polyeder. Julius Springer, Berlin, Germany, 1934.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math Sciences Dept., Univ. of Memphis, 38152, Memphis, TN

    Gautam Das

  2. Department of Computer Science, Johns Hopkins University, 21218, Baltimore, MD, USA

    Michael T. Goodrich

Authors
  1. Gautam Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael T. Goodrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Selim G. Akl Frank Dehne Jörg-Rüdiger Sack Nicola Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Das, G., Goodrich, M.T. (1995). On the complexity of approximating and illuminating three-dimensional convex polyhedra. In: Akl, S.G., Dehne, F., Sack, JR., Santoro, N. (eds) Algorithms and Data Structures. WADS 1995. Lecture Notes in Computer Science, vol 955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60220-8_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-60220-8_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60220-0

  • Online ISBN: 978-3-540-44747-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation