Weighted skeletons and fixed-share decomposition

DOI10.1016/j.comgeo.2007.08.002zbMath1138.65018OpenAlexW1967702846MaRDI QIDQ2483555

Franz Aurenhammer

Publication date: 28 April 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.08.002

zbMATH Keywords

optimal partitionpolygon decompositiongraphical examplesstraight skeleton

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Linear wavefronts of convex polyhedra ⋮ Straight skeletons and mitered offsets of nonconvex polytopes ⋮ On triangulation axes of polygons ⋮ Weighted straight skeletons in the plane ⋮ Planar Matchings for Weighted Straight Skeletons ⋮ Planar Matchings for Weighted Straight Skeletons ⋮ Reprint of: Weighted straight skeletons in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for computing the Voronoi diagram of a convex polygon
• Recognising polytopical cell complexes and constructing projection polyhedra
• Enlarging the region of convergence of Newton's method for constrained optimization
• The Steiner tree problem
• Minkowski-type theorems and least-squares clustering
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Splitting a configuration in a simplex
• Approximate convex decomposition of polygons
• ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS