The following pages link to Computing the width of a set (Q3809267):
Displaying 34 items.
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain (Q864430) (← links)
- The maximin line problem with regional demand (Q872234) (← links)
- A simple algorithm for digital line recognition in the general case (Q877107) (← links)
- A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center (Q1405006) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Computing an obnoxious anchored segment. (Q1413920) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- The visibility graph of congruent discs is Hamiltonian (Q1873692) (← links)
- Computing grasp functions (Q1917051) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- Shadow-boundaries of convex bodies (Q1923492) (← links)
- All convex polyhedra can be clamped with parallel jaw grippers (Q1924713) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Bipartite diameter and other measures under translation (Q2172648) (← links)
- Window queries for intersecting objects, maximal points and approximations using coresets (Q2235286) (← links)
- Locating a median line with partial coverage distance (Q2349526) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces (Q2368077) (← links)
- Minmax-distance approximation and separation problems: geometrical properties (Q2429461) (← links)
- Locating an obnoxious plane (Q2496077) (← links)
- ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS (Q3007722) (← links)
- Efficient Lattice Width Computation in Arbitrary Dimension (Q3648771) (← links)
- Computing the Angularity Tolerance (Q4513218) (← links)
- (Q5090454) (← links)
- Linear approximation of simple objects (Q5096785) (← links)
- LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS (Q5300001) (← links)
- RED-BLUE SEPARABILITY PROBLEMS IN 3D (Q5311632) (← links)
- Linear approximation of simple objects (Q5890660) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
- Rectilinear convex hull of points in 3D and applications (Q6618155) (← links)
