Advertisement

Discrete & Computational Geometry

, Volume 21, Issue 3, pp 405–420 | Cite as

Finding the Medial Axis of a Simple Polygon in Linear Time

  • F. Chin
  • J. Snoeyink
  • C. A. Wang

Abstract.

We give a linear-time algorithm for computing the medial axis of a simple polygon P . This answers a long-standing open question—previously, the best deterministic algorithm ran in O(n log n) time. We decompose P into pseudonormal histograms, then influence histograms, then xy monotone histograms. We can compute the medial axes for xy monotone histograms and merge to obtain the medial axis for P .

Keywords

Linear Time Medial Axis Deterministic Algorithm Simple Polygon Good Deterministic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag New York Inc. 1999

Authors and Affiliations

  • F. Chin
    • 1
  • J. Snoeyink
    • 2
  • C. A. Wang
    • 3
  1. 1.Department of Computer Science, University of Hong Kong, Hong Kong chin@csd.hku.hk HK
  2. 2.Department of Computer Science, University of British Columbia, Vancouver, British Columbia, Canada V6T 1Z4 snoeyink@cs.ubc.ca CA
  3. 3.Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada A1C 5S7 wang@garfield.cs.mun.caCA

Personalised recommendations