Robust decompositions of polyhedra

This publication has 15 references indexed in Scilit:

• Topologically sweeping an arrangement
  Journal of Computer and System Sciences, 1989
• Stable maintenance of point set triangulations in two dimensions
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
  Published by Association for Computing Machinery (ACM) ,1988
• Recipes for geometry and numerical analysis - Part I: an empirical study
  Published by Association for Computing Machinery (ACM) ,1988
• Algorithms in Combinatorial Geometry
  Published by Springer Nature ,1987
• Finite-resolution computational geometry
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1986
• Sorting jordan sequences in linear time using level-linked search trees
  Information and Control, 1986
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
  SIAM Journal on Computing, 1984
• Some NP-hard polygon decomposition problems
  IEEE Transactions on Information Theory, 1983
• The power of non-rectilinear holes
  Published by Springer Nature ,1982