On \(d\)-convex partitions of polygonal regions

zbMATH Open0997.52005MaRDI QIDQ2731381

Valentin Hlibiciuc, Kiril Prisacaru, Petru Soltan, Horst Martini

Publication date: 11 November 2002

Published in: Anale Ştiinţifice Facultatea de Matematică şi Informatică. Universitatea de Stat din Moldova (Search for Journal in Brave)

zbMATH Keywords

generalized convexitypolygonconvex subdivisionworst-case bound

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (4)

Partition of a plane set into a finite number of d-convex parts ⋮ Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems ⋮ Divided differences of inverse functions and partitions of a convex polygon ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Minimum convex partitions of multidimensional polyhedrons 👍 👎
• On convex partitions of polygonal regions 👍 👎
• On a partition into convex polygons 👍 👎
• On partition of special 3-dimensional polyhedrons into \(d\)-convex parts 👍 👎
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm 👍 👎
• On the bounded partition dimension of some classes of convex polytopes 👍 👎

This page was built for publication: On \(d\)-convex partitions of polygonal regions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2731381)