Computing the Straight Skeleton of a Simple Polygon from its Motorcycle Graph in Deterministic O(n log n) Time.

Published in: CoRR (2014)

Keyphrases

simple polygon
medial axis
endpoints
graph matching algorithm
graph structure
graph matching
homology generators
worst case
convex hull
higher order
data sets
shape representation
object detection
shortest path problem
upper bound
lower bound
feature selection