Pages that link to "Item:Q3777473"
From MaRDI portal
The following pages link to On <i>k</i>-Hulls and Related Problems (Q3777473):
Displaying 38 items.
- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas (Q393889) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- Output-sensitive peeling of convex and maximal layers (Q671619) (← links)
- Diameter, width, closest line pair, and parametric searching (Q685180) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- Partitioning arrangements of lines. I: An efficient deterministic algorithm (Q914373) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Approximate centerpoints with proofs (Q991175) (← links)
- Point set stratification and Delaunay depth (Q1019881) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- Finding the \(\Theta \)-guarded region (Q1037785) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- Partitioning point sets in arbitrary dimension (Q1088420) (← links)
- An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
- Geometric medians (Q1201233) (← links)
- Algorithms for ham-sandwich cuts (Q1329191) (← links)
- \(k\)-violation linear programming (Q1336744) (← links)
- Computing a centerpoint of a finite planar set of points in linear time (Q1338958) (← links)
- Cutting dense point sets in half (Q1355189) (← links)
- The complexity of hyperplane depth in the plane (Q1423588) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- Methods for estimation of convex sets (Q1730906) (← links)
- Concentration of the empirical level sets of Tukey's halfspace depth (Q1740596) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Order-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes (Q2350607) (← links)
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem (Q2373932) (← links)
- Algorithms for bivariate zonoid depth (Q2456661) (← links)
- PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
- Divide and Conquer Method for k-Set Polygons (Q5302751) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
- Robust shape fitting via peeling and grating coresets (Q5920504) (← links)
