Pages that link to "Item:Q3691073"
From MaRDI portal
The following pages link to On the convex layers of a planar set (Q3691073):
Displayed 23 items.
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- A faster algorithm for the maximum weighted tardiness problem (Q916393) (← links)
- Efficient generation of simple polygons for characterizing the shape of a set of points in the plane (Q936454) (← links)
- Point set stratification and Delaunay depth (Q1019881) (← links)
- Algorithms for optimal outlier removal (Q1026234) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q1196456) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- Geometric medians (Q1201233) (← links)
- Onion polygonizations (Q1351597) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Constructing the convex hull of a partially sorted set of points (Q1803271) (← links)
- Output-sensitive results on convex hulls, extreme points, and related problems (Q1816463) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- On embedding an outer-planar graph in a point set (Q1862133) (← links)
- Simplification of surface parametrizations --a lattice polygon approach (Q1878488) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- Triangulating with high connectivity. (Q2482884) (← links)
- Angle-restricted tours in the plane. (Q2482907) (← links)
- Selection and sorting in totally monotone arrays (Q3979609) (← links)
- PARTITIONING COLORED POINT SETS INTO MONOCHROMATIC PARTS (Q4818568) (← links)