Journal of the ACM Bibliography

Ketan Mulmuley. A fast planar partition algorithm, II. Journal of the ACM, 38(1):74-103, January 1991. [BibTeX entry]
Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems -- computations on discrete structures, geometrical problems and computations; G.2.1 [Discrete Mathematics]: Combinatorics -- combinatorical algorithms; I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism -- visible line/surface algorithms

General Terms: Algorithms, Theory

Additional Key Words and Phrases: Computational complexity, computational geometry, hidden surface removal, randomized geometric algorithms, planar subdivision

Selected papers that cite this one

Selected references


Shortcuts:

  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database