The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Principles of interactive computer graphics (2nd ed.)
Principles of interactive computer graphics (2nd ed.)
Optimal point location in a monotone subdivision
SIAM Journal on Computing
On Finding the Maxima of a Set of Vectors
Journal of the ACM (JACM)
Multidimensional divide-and-conquer
Communications of the ACM
Fractional Cascading: A Data Structuring Technique with Geometric Applications
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A 3-space partition and its applications
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Multidimensional search trees that provide new types of memory reductions
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present two algorithms for pictures of polyhedral scenes. These algorithms have been conjectured (and used for some time), but only now been verified. The combinatorial algorithm, proposed by Sugihara, uses counts on the incidence structure to characterize pictures which are generically the projection of sharp polyhedral scenes of planes and points. The geometric algorithm, described by Clerk Maxwell and rediscovered in the last decade, uses a reciprocal diagram in the plane to characterize pictures of strict oriented polyhedra in space.