Pages that link to "Item:Q5897095"
From MaRDI portal
The following pages link to Discrete and Computational Geometry (Q5897095):
Displaying 15 items.
- Recognition of largest empty orthoconvex polygon in a point set (Q407528) (← links)
- On the minimum number of mutually disjoint holes in planar point sets (Q904107) (← links)
- On the number of empty convex quadrilaterals of a finite set in the plane (Q998607) (← links)
- On polygons enclosing point sets. II (Q1043822) (← links)
- The \(n\)-point and six-partite point of a convex polygon (Q1591894) (← links)
- On a partition into convex polygons (Q1917247) (← links)
- Partitioning point sets in space into disjoint convex polytopes (Q1961383) (← links)
- Dispersing and grouping points on planar segments (Q2232600) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Problem of partitioning a planar point set into empty convex polygons (Q2824967) (← links)
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS (Q5694057) (← links)
- Disjoint empty convex polygons in planar point sets (Q5945676) (← links)
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) (Q6060047) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
