Geometric optimization and sums of algebraic functions

DOI10.1145/2532647MaRDI QIDQ5501958zbMATH OpenFDO

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

zbMATH Keywords

approximation algorithmsgeometric optimization

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(7)

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

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)