Geometric optimization and sums of algebraic functions

DOI10.1145/2532647zbMATH Open1321.68441MaRDI QIDQ5501958FDOQ5501958

Authors: Antoine Vigneron 

Publication date: 14 August 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://hal.inrae.fr/hal-02757340/file/39366_20100928101208768_1.pdf

Recommendations

• Geometric optimization and sums of algebraic functions
• Some easy and some not so easy geometric optimization problems
• Geometric applications of a randomized optimization technique
• Geometric optimization revisited
• The algebraic degree of geometric optimization problems

zbMATH Keywords

approximation algorithmsgeometric optimization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• The weighted region problem
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• Finding a guard that sees most and a shop that sells most
• On computing a set of points meeting every cell defined by a family of polynomials on a variety
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Maximizing the overlap of two planar convex sets under rigid motions
• On overlays and minimization diagrams
• The overlay of lower envelopes and its applications
• How to get close to the median shape
• Matching convex shapes with respect to the symmetric difference
• On minimum-area hulls
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• Title not available (Why is that?)
• Determining an optimal penetration among weighted regions in two and three dimensions
• Improved construction of vertical decompositions of three-dimensional arrangements
• Title not available (Why is that?)
• On some geometric optimization problems in layered manufacturing
• Almost tight upper bounds for vertical decompositions in four dimensions
• Maximum overlap of convex polytopes under translation
• Efficient algorithms for shared camera control

Cited In (6)

• Geometric optimization and sums of algebraic functions
• Approximating the packedness of polygonal curves
• The algebraic degree of geometric optimization problems
• Matching sets of line segments
• Approximating the Packedness of Polygonal Curves
• Approximating the maximum overlap of polygons under translation

This page was built for publication: Geometric optimization and sums of algebraic functions

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