Pages that link to "Item:Q3691073"
From MaRDI portal
The following pages link to On the convex layers of a planar set (Q3691073):
Displaying 50 items.
- Relative convex hulls in semi-dynamic arrangements (Q476434) (← links)
- On the red/blue spanning tree problem (Q534557) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- Augmenting the edge connectivity of planar straight line graphs to three (Q652523) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Multilist layering: Complexity and applications (Q673793) (← links)
- The layer number of \(\alpha \)-evenly distributed point sets (Q785830) (← links)
- Dynamic coresets (Q834605) (← links)
- In-place algorithms for computing (Layers of) maxima (Q848632) (← 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)
- Finding the \(\Theta \)-guarded region (Q1037785) (← 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)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- New estimates for convex layer numbers (Q2032744) (← links)
- A new variational approach based on level-set function for convex hull problem with outliers (Q2037215) (← links)
- Expected size of random Tukey layers and convex layers (Q2123288) (← links)
- Novel concave hull-based heuristic algorithm for TSP (Q2139346) (← links)
- Revisiting Shao and Sokal's \(B_2\) index of phylogenetic balance (Q2244896) (← links)
- Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
- Four-connected triangulations of planar point sets (Q2351013) (← links)
- A fixed-parameter algorithm for guarding 1.5D terrains (Q2354771) (← links)
- Drawing the almost convex set in an integer grid of minimum size (Q2401331) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← 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)
- Spiral Serpentine Polygonization of a Planar Point Set (Q4899273) (← links)
- Upper envelope onion peeling (Q5056118) (← links)
- Applications of a semi-dynamic convex hull algorithm (Q5056119) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Grid peeling and the affine curve-shortening flow (Q5232728) (← links)
- (Q6124757) (← links)
- Likelihood-based inference for exponential-family random graph models via linear programming (Q6144428) (← links)
- Exact and heuristic solutions for the prize‐collecting geometric enclosure problem (Q6154939) (← links)
