Pages that link to "Item:Q3761211"
From MaRDI portal
The following pages link to Fast computation of the modality of polygons (Q3761211):
Displaying 14 items.
- On the modality of convex polygons (Q748888) (← links)
- Geometric applications of a matrix-searching algorithm (Q1101223) (← links)
- On the unimodality of convex polygons (Q1113454) (← links)
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
- The morphology of convex polygons (Q1205915) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- Algorithmen zur Unimodalitätsbestimmung einfacher Polygone. (Algorithms for determination of unimodality of simple polygons) (Q1263963) (← links)
- Moldable and castable polygons (Q1334613) (← links)
- Probing polygons minimally is hard (Q1803270) (← links)
- Complexity, convexity, and unimodality (Q3219150) (← links)
- Constructing bimodal convex hexagons (Q3478004) (← links)
- (Q4022618) (← links)
- (Q4316716) (← links)
- Fast polyhedra abstract domain (Q5370845) (← links)