Computing the width of a set

DOI10.1109/34.6790MaRDI QIDQ3809267zbMATH OpenOpenAlexFDO

Authors Godfried 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

antipodal pairscomputational geometryconvex hullgeometric complexitygeometric transformsimage processingminimax approximating lineminimax approximating planepattern recognitionrotating caliperswidth

Mathematics Subject Classification ID

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

Recommendations

• A memetic algorithm to schedule planned maintenance for the national grid
• Off-line dynamic maintenance of the width of a planar point set
• scientific article; zbMATH DE number 1305508
• Diameter, width, closest line pair, and parametric searching
• Publication:4952660

Cited in

(41)

• A (\(1+{\varepsilon}\))-approximation algorithm for 2-line-center
• Continuous location of dimensional structures.
• Computing an obnoxious anchored segment.
• Efficient randomized algorithms for some geometric optimization problems
• The visibility graph of congruent discs is Hamiltonian
• Computing grasp functions
• The exact fitting problem in higher dimensions
• Shadow-boundaries of convex bodies
• All convex polyhedra can be clamped with parallel jaw grippers
• Rearranging a sequence of points onto a line
• Bipartite diameter and other measures under translation
• Window queries for intersecting objects, maximal points and approximations using coresets
• FPT-algorithm for computing the width of a simplex given by a convex hull
• Locating a median line with partial coverage distance
• 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
• Minmax-distance approximation and separation problems: geometrical properties
• Locating an obnoxious plane
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Improved Algorithm for a Widest 1-Corner Corridor
• Efficient lattice width computation in arbitrary dimension
• Minimizing the error of linear separators on linearly inseparable data
• Computing the Angularity Tolerance
• Bipartite diameter and other measures under translation
• Linear approximation of simple objects
• Locating an obnoxious line among planar objects
• RED-BLUE SEPARABILITY PROBLEMS IN 3D
• A memetic algorithm to schedule planned maintenance for the national grid
• Linear approximation of simple objects
• Linear approximation of simple objects
• Radius, diameter, incenter, circumcenter, width and minimum enclosing cylinder for some polyhedral distance functions
• Fitting a two-joint orthogonal chain to a point set
• Computing efficiently the lattice width in any dimension
• Rectilinear convex hull of points in 3D and applications
• Diameter, width, closest line pair, and parametric searching
• On k-enclosing slab problems
• Parallel line centers with guaranteed separation
• Planar expropriation problem with non-rigid rectangular facilities
• On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
• The maximin line problem with regional demand
• A simple algorithm for digital line recognition in the general case

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3809267)