scientific article; zbMATH DE number 742950
From MaRDI portal
Publication:4763391
Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continuous location (90B85) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60) 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)- Compaction and separation algorithms for non-convex polygons and their applications
- The upper envelope of Voronoi surfaces and its applications
- Computing the smallest k-enclosing circle and related problems
- Extremal polygon containment problems
- Can visibility graphs be represented compactly?
- Minimum width color spanning annulus
- 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
- Approximate matching of polygonal shapes
- Parametric search: three new applications
- 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
- Minimax Parametric Optimization Problems and Multidimensional Parametric Searching
- Improvements on geometric pattern matching problems
- Minimax parametric optimization problems and multi-dimensional parametric searching
- On nonlinear parametric search
- Parametric search made practical
- Geometric pattern matching in d-dimensional space
- Computing the maximum overlap of two convex polygons under translations
- Geometric pattern matching under Euclidean motion
- Diameter, width, closest line pair, and parametric searching
- Parametric solutions involving geometry: a step towards efficient shape optimization
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)
