Computing the width of a set

DOI10.1109/34.6790zbMath0659.68067OpenAlexW2085641990MaRDI QIDQ3809267

Godfried T. Toussaint, Michael E. Houle

Publication date: 1988

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/34.6790

zbMATH Keywords

pattern recognitionimage processingwidthconvex hullantipodal pairscomputational geometrygeometric complexitygeometric transformsminimax approximating lineminimax approximating planerotating calipers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (3) dimensions (including convex surfaces) (52A15) Polytopes and polyhedra (52Bxx)

Related Items (33)

The visibility graph of congruent discs is Hamiltonian ⋮ Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications ⋮ Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces ⋮ Rearranging a sequence of points onto a line ⋮ LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ RED-BLUE SEPARABILITY PROBLEMS IN 3D ⋮ On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain ⋮ The maximin line problem with regional demand ⋮ Computing grasp functions ⋮ The exact fitting problem in higher dimensions ⋮ Bipartite diameter and other measures under translation ⋮ A simple algorithm for digital line recognition in the general case ⋮ Shadow-boundaries of convex bodies ⋮ All convex polyhedra can be clamped with parallel jaw grippers ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center ⋮ Minmax-distance approximation and separation problems: geometrical properties ⋮ Minimizing the error of linear separators on linearly inseparable data ⋮ Continuous location of dimensional structures. ⋮ Computing efficiently the lattice width in any dimension ⋮ Computing an obnoxious anchored segment. ⋮ Linear approximation of simple objects ⋮ Linear approximation of simple objects ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS ⋮ Planar expropriation problem with non-rigid rectangular facilities ⋮ Locating an obnoxious plane ⋮ Unnamed Item ⋮ Linear approximation of simple objects ⋮ Efficient randomized algorithms for some geometric optimization problems ⋮ Efficient Lattice Width Computation in Arbitrary Dimension ⋮ Locating a median line with partial coverage distance ⋮ Computing the Angularity Tolerance

This page was built for publication: Computing the width of a set