On overlays and minimization diagrams

DOI10.1007/S00454-009-9139-5zbMATH Open1455.52027OpenAlexW2005644466MaRDI QIDQ1014331FDOQ1014331

Authors: Vladlen Koltun, Micha Sharir 

Publication date: 27 April 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-009-9139-5

Recommendations

• The Partition Technique for Overlays of Envelopes
• The overlay of lower envelopes and its applications
• The overlay of minimization diagrams in a randomized incremental construction
• scientific article; zbMATH DE number 2119742
• Matching polyhedral terrains using overlays of envelopes

zbMATH Keywords

arrangementsoverlayscombinatorial complexitylower envelopesminimization diagrams

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45)

Cites Work

• Lectures on Polytopes
• Voronoi diagrams and arrangements
• An optimal convex hull algorithm in any fixed dimension
• Title not available (Why is that?)
• Algorithms in real algebraic geometry
• The maximum numbers of faces of a convex polytope
• Almost tight upper bounds for lower envelopes in higher dimensions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Randomized Algorithm for Closest-Point Queries
• Computing Envelopes in Four Dimensions with Applications
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• The overlay of lower envelopes and its applications
• The Partition Technique for Overlays of Envelopes
• The upper envelope of piecewise linear functions: Tight bounds on the number of faces
• Approximation algorithms for minimum-width annuli and shells
• Exact and approximation algorithms for minimum-width cylindrical shells
• Matching polyhedral terrains using overlays of envelopes
• Vertical decomposition of arrangements of hyperplanes in four dimensions
• Title not available (Why is that?)

Cited In (6)

• The Partition Technique for Overlays of Envelopes
• Maximal f-vectors of Minkowski sums of large numbers of polytopes
• The overlay of minimization diagrams in a randomized incremental construction
• The overlay of lower envelopes and its applications
• The delunification process and minimal diagrams
• Geometric optimization and sums of algebraic functions

This page was built for publication: On overlays and minimization diagrams

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