Efficient computation of continuous skeletons

  title={Efficient computation of continuous skeletons},
  author={David G. Kirkpatrick},
  journal={20th Annual Symposium on Foundations of Computer Science (sfcs 1979)},
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. 
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS


Publications citing this paper.
Showing 1-10 of 140 extracted citations

WALCOM: Algorithms and Computation

Lecture Notes in Computer Science • 2015
View 20 Excerpts
Highly Influenced

Spanning Trees in Multipartite Geometric Graphs

Algorithmica • 2017
View 4 Excerpts
Highly Influenced

Shortest Paths Among Obstacles in the Plane

Symposium on Computational Geometry • 1993
View 4 Excerpts
Highly Influenced

An O (n log n) Algorithm for the Voronoi Diagram of a Set of Simple Curve Segments

Discrete & Computational Geometry • 1987
View 5 Excerpts
Highly Influenced


Publications referenced by this paper.

The Nedia 1 Axis of a Simple Polygon " , } ) rocee < Lings of the Sixth Symposium un Hathernatic 31 Foundations

F. P. Preparata

Similar Papers

Loading similar papers…