Decomposing the boundary of a nonconvex polyhedron

This publication has 15 references indexed in Scilit:

• Triangulating a nonconvex polytope
  Discrete & Computational Geometry, 1990
• Visibility and intersection problems in plane geometry
  Discrete & Computational Geometry, 1989
• On monotone paths among obstacles with applications to planning assemblies
  Published by Association for Computing Machinery (ACM) ,1989
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
  Algorithmica, 1987
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
  ACM Transactions on Graphics, 1985
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
  SIAM Journal on Computing, 1984
• Optimal Search in Planar Subdivisions
  SIAM Journal on Computing, 1983
• Fast triangulation of simple polygons
  Published by Springer Nature ,1983
• The power of non-rectilinear holes
  Published by Springer Nature ,1982
• Finding the intersection of two convex polyhedra
  Theoretical Computer Science, 1978