An exact algorithm for constructing minimum Euclidean skeletons of polygons
From MaRDI portal
Publication:2131144
Recommendations
- An exact algorithm for the minimum dilation triangulation problem
- On the minimality of polygon triangulation
- A simple algorithm for computing positively weighted straight skeletons of monotone polygons
- scientific article; zbMATH DE number 1305489
- An approximate algorithm for the minimal vertex nested polygon problem
- Skeletonization of polygonal figures based on the generalized Delaunay triangulation
- An optimal algorithm for finding the separation of simple polygons
- An optimal algorithm for finding minimal enclosing triangles
- A faster algorithm for computing straight skeletons
Cites work
- A near linear time approximation scheme for Steiner tree among obstacles in the plane
- An Approximation Scheme for Finding Steiner Trees with Obstacles
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
- Generating random polygons with given vertices
- Steiner's problem in graphs and its implications
- Thinning out Steiner trees: a node-based model for uniform edge costs
Cited in
(3)
This page was built for publication: An exact algorithm for constructing minimum Euclidean skeletons of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2131144)