On computing the voronoi diagram for restricted planar figures

This publication has 11 references indexed in Scilit:

• Triangulating a simple polygon in linear time
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Voronoi diagrams with barriers and the shortest diagonal problem
  Information Processing Letters, 1989
• A sweepline algorithm for Voronoi diagrams
  Algorithmica, 1987
• Algorithms in Combinatorial Geometry
  Published by Springer Nature ,1987
• An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
  Published by Association for Computing Machinery (ACM) ,1987
• Generalized delaunay triangulation for planar graphs
  Discrete & Computational Geometry, 1986
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
  ACM Transactions on Graphics, 1985
• Computational Geometry
  Published by Springer Nature ,1985
• On partitioning polygons
  Published by Association for Computing Machinery (ACM) ,1985
• A theorem on polygon cutting with applications
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982