Login / Signup

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces

Kenneth L. ClarksonHerbert EdelsbrunnerLeonidas J. GuibasMicha SharirEmo Welzl
Published in: FOCS (1988)
Keyphrases
  • complexity bounds
  • implicit polynomial
  • worst case
  • free form
  • closed curves
  • constraint networks
  • smooth curves
  • query containment
  • transitive closure
  • satisfiability problem