• Publications
  • Influence
Computational geometry in C
TLDR
This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. Expand
  • 1,949
  • 56
Art gallery theorems and algorithms
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
TLDR
An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions in optimal 0 (n d ) time for d ~2. Expand
  • 336
  • 12
  • PDF
Constructing Arrangements of Lines and Hyperplanes with Applications
TLDR
A finite set of lines partitions the Euclidean plane into a cell complex. Expand
  • 231
  • 11
Worst-case optimal algorithms for constructing visibility polygons with holes
TLDR
EIGindy and Avis [EA] considered the problem of determining the visibility polygon from a point inside a polygon. Expand
  • 120
  • 10
Handbook of Discrete and Computational Geometry, Second Edition
TLDR
We present a number of new geometrical and computational methods and applications.COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J.W. Richter-Gebert and G. Schulte Polytope Skeletons and Paths, G. Seidel Voronoi Diagrams and Delaunay Triangulations, S.K. Bjoerner Symmetry of Polytopes and Polyhedra, E. Expand
  • 1,070
  • 9
Finding minimal enclosing boxes
  • J. O'Rourke
  • Mathematics, Computer Science
  • International Journal of Computer & Information…
  • 1 June 1985
TLDR
The problem of finding minimal volume boxes circumscribing a given set of three-dimensional points is investigated. Expand
  • 162
  • 8
Finding Minimal Convex Nested Polygons
TLDR
We present an O(n log k) algorithm for finding a minimal nested polygon nested between two convex polygons that has a minimal number of vertices. Expand
  • 39
  • 7
Computing circular separability
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 accomplishedExpand
  • 74
  • 5
  • PDF