• Publications
  • Influence
Computational geometry in C
The basic techniques used in computational geometry are all covered: polygon triangualtions, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning.
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.
Computational geometry in C (2nd ed.)
Geometric folding algorithms - linkages, origami, polyhedra
Aimed primarily at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from high school students to researchers.
Constructing arrangements of lines and hyperplanes with applications
An optimal algorithm is presented for constructing an arrangement of hyperplanes in arbitrary dimensions and is shown to improve known worst-case time complexities for five problems: computing all order-k Voronoi diagrams, computing the λ-matrix, estimating halfspace queries, degeneracy testing, and finding the minimum volume simplex determined by a set of points.
Constructing Arrangements of Lines and Hyperplanes with Applications
An algorithm is presented that constructs a representation for the cell complex defined by n hyperplanes in optimal $O(n^d )$ time in d dimensions, which is shown to lead to new methods for computing $\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices.
Worst-case optimal algorithms for constructing visibility polygons with holes
A worst-ease lower bound of N(n 4) for explicitly computing the boundary of the visibility polygon from a line segment in the presence of other line segments is established, and an optimal algorithm to construct the boundary is designed.
Handbook of Discrete and Computational Geometry, Second Edition
COMBINATORIAL AND DISCRETE GEOMETRY Finite Point Configurations, J. Pach Packing and Covering, G. Fejes Toth Tilings, D. Schattschneider and M. Senechal Helly-Type Theorems and Geometric
Finding minimal enclosing boxes
  • J. O'Rourke
  • Mathematics, Computer Science
    International Journal of Computer & Information…
  • 1 June 1985
It is proven that at least two adjacent box sides are flush with edges of the hull of the convex hull, and this characterization enables the anO(n3) algorithm to find all minimal boxes for a set ofn points.