On overlays and minimization diagrams

DOI10.1007/S00454-009-9139-5MaRDI QIDQ1014331zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

arrangementsoverlayscombinatorial complexitylower envelopesminimization diagrams

Mathematics Subject Classification ID

Combinatorial complexity of geometric structures (52C45)

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
• Publication:4829017
• Matching polyhedral terrains using overlays of envelopes

Cites work

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

Cited in

(6)

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

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)