Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Computational geometry in C
- J. O'Rourke
- Computer Science, Mathematics
- 1 April 1995
TLDR
Art gallery theorems and algorithms
- J. O'Rourke
- Mathematics
- 1987
Polygon partitions Orthogonal polygons Mobile guards Miscellaneous shapes Holes Exterior visibility Visibility groups Visibility algorithms Minimal guard covers Three-dimensions and miscellany.
- 1,466
- 55
Constructing arrangements of lines and hyperplanes with applications
- H. Edelsbrunner, J. O'Rourke, R. Seidel
- Computer Science
- 24th Annual Symposium on Foundations of Computer…
- 7 November 1983
TLDR
Constructing Arrangements of Lines and Hyperplanes with Applications
- H. Edelsbrunner, J. O'Rourke, R. Seidel
- Mathematics, Computer Science
- SIAM J. Comput.
- 1 May 1986
TLDR
Worst-case optimal algorithms for constructing visibility polygons with holes
- S. Suri, J. O'Rourke
- Computer Science
- SCG '86
- 1 August 1986
TLDR
Handbook of Discrete and Computational Geometry, Second Edition
- J. Goodman, J. O'Rourke
- Mathematics, Computer Science
- 1997
TLDR
Galleries need fewer mobile guards: A variation on Chvátal's theorem
- J. O'Rourke
- Mathematics
- 1 September 1983
Finding minimal enclosing boxes
- J. O'Rourke
- Mathematics, Computer Science
- International Journal of Computer & Information…
- 1 June 1985
TLDR
Finding Minimal Convex Nested Polygons
- A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, C. Yap
- Mathematics, Computer Science
- Inf. Comput.
- 1 October 1989
TLDR
Computing circular separability
- J. O'Rourke, S. Rao Kosaraju, N. Megiddo
- Mathematics
- 1 December 1986
Two sets of planar pointsS1 andS2 are circularly separable if there is a circle that enclosesS1 but excludesS2. We show that deciding whether two sets are circularly separable can be accomplished… Expand