scientific article; zbMATH DE number 742950
From MaRDI portal
Publication:4763391
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Abstract computational complexity for mathematical programming problems (90C60) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Continuous location (90B85) Mathematical programming (90C99)
Recommendations
- Applications of Parametric Searching in Geometric Optimization
- Diameter, width, closest line pair, and parametric searching
- Parametric search: three new applications
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
- Minimax parametric optimization problems and multi-dimensional parametric searching
Cited in
(25)- Parametric search: three new applications
- Geometric pattern matching in d-dimensional space
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
- Extremal polygon containment problems
- Computing the smallest \(k\)-enclosing circle and related problems
- Compaction and separation algorithms for non-convex polygons and their applications
- Computing the maximum overlap of two convex polygons under translations
- Parametric solutions involving geometry: a step towards efficient shape optimization
- On nonlinear parametric search
- Minimax parametric optimization problems and multi-dimensional parametric searching
- Minimum width color spanning annulus
- Improvements on geometric pattern matching problems
- The upper envelope of Voronoi surfaces and its applications
- Can visibility graphs be represented compactly?
- Geometric pattern matching under Euclidean motion
- Parametric search made practical
- An optimal algorithm for roundness determination on convex polygons
- Approximate matching of polygonal shapes
- scientific article; zbMATH DE number 1305444 (Why is no real title available?)
- Applications of Parametric Searching in Geometric Optimization
- An Expander-Based Approach to Geometric Optimization
- Parametric search made practical
- Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
- Efficient piecewise-linear function approximation using the uniform metric
- Diameter, width, closest line pair, and parametric searching
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 Q4763391)
