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

pattern recognitioncomputational geometryconvex hullimage processingwidthgeometric complexitygeometric transformsantipodal pairsminimax approximating lineminimax approximating planerotating calipers

Mathematics Subject Classification ID

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

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)

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

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)