Recognising polytopical cell complexes and constructing projection polyhedra
Journal of Symbolic Computation
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
Splitting a Configuration in a Simplex
SIGAL '90 Proceedings of the International Symposium on Algorithms
Decomposing a polygon into its convex parts
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Building Voronoi Diagrams for Convex Polygons in Linear Expected Time
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Interactive architectural modeling with procedural extrusions
ACM Transactions on Graphics (TOG)
| Hi-index | 0.00 |
We introduce the concept of weighted skeleton of a polygon and present various decomposition and optimality results for this skeletal structure when the underlying polygon is convex.