Pages that link to "Item:Q6487986"
From MaRDI portal
The following pages link to Finding the medial axis of a simple polygon in linear time (Q6487986):
Displaying 11 items.
- Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- Finding the medial axis of a simple polygon in linear time (Q1289244) (← links)
- On fat partitioning, fat covering and the union size of polygons (Q1384209) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- An algorithm for determining the medial axis of an arbitrary simple polygon (Q2735396) (← links)
- (Q3842109) (← links)
- A straightforward algorithm for computing the medial axis of a simple polygon (Q3989852) (← links)
- Linear-time heuristics for minimum weight rectangulation (Q5054819) (← links)
- VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments (Q5943290) (← links)