Voronoi diagram for multiply-connected polygonal domains 1: algorithm
IBM Journal of Research and Development
Voronoi diagram for multiply-connected polygonal domains 11: implementation and application
IBM Journal of Research and Development
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Divide-and-conquer for Voronoi diagrams revisited
Proceedings of the twenty-fifth annual symposium on Computational geometry
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
Computer-Aided Design
Linear axis for general polygons: properties and computation
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Obstacle discovery in distributed actuator and sensor networks
ACM Transactions on Sensor Networks (TOSN)
Divide-and-conquer for Voronoi diagrams revisited
Computational Geometry: Theory and Applications
Voronoi graph matching for robot localization and mapping
Transactions on computational science IX
Voronoi graph matching for robot localization and mapping
Transactions on computational science IX
SIAM Journal on Computing
Developments in data structure research during the first 25 years of FSTTCS
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Euclidean voronoi diagrams of 3d spheres: their construction and related problems from biochemistry
IMA'05 Proceedings of the 11th IMA international conference on Mathematics of Surfaces
Autonomous construction of hierarchical voronoi-based route graph representations
SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
Optimization schemes for protective jamming
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
On the generation and pruning of skeletons using generalized Voronoi diagrams
Pattern Recognition Letters
Offset polygon and annulus placement problems
Computational Geometry: Theory and Applications
Optimization Schemes for Protective Jamming
Mobile Networks and Applications
| Hi-index | 0.00 |
An O(n lgn) algorithm is presented for the construction of skeletons of arbitrary n-line polygonal figures. This algorithm is based on an O(n lgn) algorithm for the construction of generalized Voronoi diagrams (our generalization replaces point sets by sets of line segments constrained to intersect only at end points). The generalized Voronoi diagram algorithm employs a linear time algorithm for the merging of two arbitrary (standard) Voronoi diagrams.