Finding the medial axis of a simple polygon in linear time

DOI10.1007/PL00009429zbMath0922.68128MaRDI QIDQ1289244

F. Chin, Jack Scott Snoeyink, Cao An Wang

Publication date: 27 May 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

linear-time algorithm

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Unnamed Item, AN APPROXIMATE MORPHING BETWEEN POLYLINES, The snowblower problem, Convexity-increasing morphs of planar graphs, Conformal mapping in linear time, An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments, Realistic roofs over a rectilinear polygon, Reachability by paths of bounded curvature in a convex polygon, Computing hereditary convex structures, Exact and approximation algorithms for computing optimal fat decompositions, Tree-like decompositions of simply connected domains, Packing two disks into a polygonal environment., Divide-and-conquer for Voronoi diagrams revisited, Delaunay triangulation of imprecise points in linear time after preprocessing, An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem, Packing two disks in a polygon, On the estimation of the medial axis and inner parallel body, Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections, Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes, Median trajectories, A scheme for computing minimum covers within simple regions, Three problems about simple polygons, Approximate convex decomposition of polygons, COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION, A Scheme for Computing Minimum Covers within Simple Regions