scientific article; zbMATH DE number 4153914

MaRDI QIDQ3482828zbMATHFDO

Authors Nikolai M. Korneenko, Horst Martini

Publication date 1990

zbMATH Keywords

polynomial algorithmzonotopesEuclidean distancesupport functions

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• Weighted Rectilinear Approximation of Points in the Plane
• scientific article; zbMATH DE number 4178824
• Construction of the convex hull of a finite set of points when the computations are approximate
• scientific article; zbMATH DE number 2062646
• Approximation of planar convex sets from hyperplane probes
• scientific article; zbMATH DE number 21137
• scientific article; zbMATH DE number 637384
• Geometric spanners for weighted point sets
• Geometric Spanners for Weighted Point Sets
• Approximation of the efficient point set by perturbation of the ordering cone

Cited in

(12)

• A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
• Median hyperplanes in normed spaces -- a survey
• scientific article; zbMATH DE number 140468 (Why is no real title available?)
• Continuous location of dimensional structures.
• scientific article; zbMATH DE number 431989 (Why is no real title available?)
• Median spheres: Theory, algorithms, applications
• Weighted Rectilinear Approximation of Points in the Plane
• Locating an axis-parallel rectangle on a Manhattan plane
• scientific article; zbMATH DE number 846112 (Why is no real title available?)
• Minmax-distance approximation and separation problems: geometrical properties
• Solving restricted line location problems via a dual interpretation
• Constructing New Weighted ℓ₁-Algorithms for the Sparsest Points of Polyhedral Sets

This page was built for publication:

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