Pages that link to "Item:Q1289244"
From MaRDI portal
The following pages link to Finding the medial axis of a simple polygon in linear time (Q1289244):
Displaying 29 items.
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Realistic roofs over a rectilinear polygon (Q364851) (← links)
- Reachability by paths of bounded curvature in a convex polygon (Q425619) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- Tree-like decompositions of simply connected domains (Q664903) (← links)
- Packing two disks into a polygonal environment. (Q878013) (← links)
- Divide-and-conquer for Voronoi diagrams revisited (Q991182) (← links)
- Delaunay triangulation of imprecise points in linear time after preprocessing (Q1037646) (← links)
- An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem (Q1040080) (← links)
- Packing two disks in a polygon (Q1614067) (← links)
- On the estimation of the medial axis and inner parallel body (Q2015064) (← links)
- On selecting a fraction of leaves with disjoint neighborhoods in a plane tree (Q2161244) (← links)
- On the intersection graph of the disks with diameters the sides of a convex \(n\)-gon (Q2245950) (← links)
- Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections (Q2269068) (← links)
- Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
- Median trajectories (Q2375955) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- Deletion in Abstract Voronoi Diagrams in Expected Linear Time. (Q5115818) (← links)
- AN APPROXIMATE MORPHING BETWEEN POLYLINES (Q5311633) (← links)
- The snowblower problem (Q5894212) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- Conformal mapping in linear time (Q5962354) (← links)
- Deletion in abstract Voronoi diagrams in expected linear time and related problems (Q6045784) (← links)
- Optimal divisions of a convex body (Q6180063) (← links)