C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon.
Ahmad Biniaz
Prosenjit Bose
Anil Maheshwari
Michiel H. M. Smid
Published in:
TTCS (2015)
Keyphrases
</>
simple polygon
spanning tree
endpoints
convex hull
edge disjoint
minimum cost
minimum spanning tree
medial axis
minimum spanning trees
heat kernel
distance transform
edge weights
computational complexity
special case
shortest path
geodesic distance