Algorithms for high dimensional stabbing problems

@article{Avis1990AlgorithmsFH,
  title={Algorithms for high dimensional stabbing problems},
  author={David Avis and Mike Doskas},
  journal={Discrete Applied Mathematics},
  year={1990},
  volume={27},
  pages={39-48}
}
Given a set of geometric objects in Rd, the hyperplane transversal or stabbing problem is to determine if there exists a hyperplane that simultaneously intersects all of the objects. We give algorithms based on linear programming for various hyperplane stabbing problems where the objects are line segments or convex polyhedra. A hyperplane stabber for n segments in Rd can be found in O(nd) time. In Rd. a plane stabber for a set of m polyhedra with a total of n edges can be found in O(nd-’ m… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Multidimensional search problems

  • D. Dobkin, R. Lipton
  • SIAM J. Comput
  • 1986
1 Excerpt

On a conjecture of Griinbaum on common transversals

  • M. Katchalski
  • Math. Stand
  • 1986

Efficient algorithms for inserting and deleting edges from triangulations

  • H. ElGindy, G. T. Toussaint
  • in: Proceedings International Conference on…
  • 1985

Similar Papers

Loading similar papers…