On overlays and minimization diagrams
type: Item
instance of: scholarly article
title: On overlays and minimization diagrams
zbMATH Open document ID: 1455.52027
author: Vladlen Koltun
author: Micha Sharir
published in: Discrete \& Computational Geometry
publication date: 2009-04-27T00:00:00Z
Mathematics Subject Classification ID: 52C45
zbMATH DE Number: 5547545
zbMATH Keywords: overlays
zbMATH Keywords: lower envelopes
zbMATH Keywords: minimization diagrams
zbMATH Keywords: arrangements
zbMATH Keywords: combinatorial complexity
MaRDI profile type: Publication
full work available at URL: s00454-009-9139-5
OpenAlex ID: W2005644466
cites work: Q4945502
cites work: The overlay of lower envelopes and its applications
cites work: Computing Envelopes in Four Dimensions with Applications
cites work: Approximation algorithms for minimum-width annuli and shells
cites work: Exact and approximation algorithms for minimum-width cylindrical shells
cites work: Algorithms in real algebraic geometry
cites work: APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
cites work: An optimal convex hull algorithm in any fixed dimension
cites work: A Randomized Algorithm for Closest-Point Queries
cites work: Q5501788
cites work: The upper envelope of piecewise linear functions: Tight bounds on the number of faces
cites work: Voronoi diagrams and arrangements
cites work: Q3601527
cites work: Vertical decomposition of arrangements of hyperplanes in four dimensions
cites work: The Partition Technique for Overlays of Envelopes
cites work: Matching polyhedral terrains using overlays of envelopes
cites work: The maximum numbers of faces of a convex polytope
cites work: Almost tight upper bounds for lower envelopes in higher dimensions
cites work: Q4325546
cites work: Lectures on Polytopes
DOI: 10.1007/S00454-009-9139-5
description: scientific article; zbMATH DE number 5547545