scientific article; zbMATH DE number 742950
From MaRDI portal
Publication:4763391
zbMath0818.90137MaRDI QIDQ4763391
Sivan Toledo, Micha Sharir, Pankaj K. Agarwal
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational aspects related to convexity (52B55) Abstract computational complexity for mathematical programming problems (90C60) Continuous location (90B85) Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Mathematical programming (90C99)
Related Items
Computing the smallest \(k\)-enclosing circle and related problems, Extremal polygon containment problems, Can visibility graphs be represented compactly?, Improvements on geometric pattern matching problems, Efficient piecewise-linear function approximation using the uniform metric, An optimal algorithm for roundness determination on convex polygons, Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation, Compaction and separation algorithms for non-convex polygons and their applications, Approximate matching of polygonal shapes, Geometric pattern matching in d-dimensional space, Geometric pattern matching under Euclidean motion, Minimum width color spanning annulus, Diameter, width, closest line pair, and parametric searching, The upper envelope of Voronoi surfaces and its applications, Parametric search: three new applications
