Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description (Q1300769): Difference between revisions

[For part I see ibid. 102, No. 1, 119-141 (1999; Zbl 0939.65018).] In this second part of the paper, that constructs the Voronoi diagram and medial axis of a planar domain bounded by free-form (polynomial or rational) curve segments, the authors present details of the algorithms. They focus on key topological and computational issues including the data structures, Boolean operations, curve intersection algorithms, and iterative schemes. Numerical examples illustrate the capabilities of the algorithm.