Partitioning a planar point set into empty convex polygons
From MaRDI portal
Publication:5897095
DOI10.1007/B11261zbMATH Open1179.52015OpenAlexW62175113MaRDI QIDQ5897095FDOQ5897095
Kiyoshi Hosono, Ren Ding, Masatsugu Urabe, Changqing Xu
Publication date: 5 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11261
Recommendations
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Erd?s problems and related topics of discrete geometry (52C10)
Cited In (15)
- On the minimum number of mutually disjoint holes in planar point sets
- The \(n\)-point and six-partite point of a convex polygon
- Recognition of largest empty orthoconvex polygon in a point set
- Disjoint empty convex polygons in planar point sets
- Dispersing and grouping points on planar segments
- Partitioning point sets in space into disjoint convex polytopes
- Twenty years of progress of \(\mathrm{JCDCG}^3\)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
- Title not available (Why is that?)
- Problem of partitioning a planar point set into empty convex polygons
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- On polygons enclosing point sets. II
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set
- On the number of empty convex quadrilaterals of a finite set in the plane
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
This page was built for publication: Partitioning a planar point set into empty convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897095)
