Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description (Q1300769): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1356630 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Wang Cheng-Shu / rank | |||
Normal rank | |||
Revision as of 14:27, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description |
scientific article |
Statements
Voronoi diagram and medial axis algorithm for planar domains with curved boundaries. II: Detailed algorithm description (English)
0 references
31 May 2001
0 references
[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.
0 references
Voronoi diagram
0 references
medial axis
0 references
algorithm
0 references
curve intersection
0 references
iterative schemes
0 references
numerical examples
0 references
