Average case analysis of dynamic geometric optimization
type: Item
instance of: scholarly article
title: Average case analysis of dynamic geometric optimization
zbMATH Open document ID: 0849.68121
DOI: 10.1016/0925-7721(95)00018-6
author: David Eppstein
published in: Computational Geometry
publication date: 1996-11-04T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 902876
zbMATH Keywords: maximum spanning tree
zbMATH Keywords: rotating caliper graph
MaRDI profile type: Publication
full work available at URL: 0925-7721(95)00018-6
OpenAlex ID: W2013987819
cites work: Euclidean minimum spanning trees and bichromatic closest pairs
cites work: Q4230329
cites work: Q4037411
cites work: Off-line dynamic maintenance of the width of a planar point set
cites work: Q4886061
cites work: Helly-type theorems and generalized linear programming
cites work: Q4763412
cites work: Decomposable searching problems I. Static-to-dynamic transformation
cites work: Voronoi diagrams from convex hulls
cites work: Q4037406
cites work: Incremental topological flipping works for regular triangulations
cites work: Q4037435
cites work: Dynamic Euclidean minimum spanning trees and extrema of binary functions
cites work: Q4230327
cites work: Q3138871
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Q4038708
cites work: ON MAINTAINING THE WIDTH AND DIAMETER OF A PLANAR POINT-SET ONLINE
cites work: Q3975933
cites work: Computing Euclidean maximum spanning trees
cites work: A fast planar partition algorithm. I
cites work: Q3134498
cites work: Q3992847
cites work: Fully Dynamic Point Location in a Monotone Subdivision
cites work: Small-dimensional linear programming and convex hulls made easy
cites work: A data structure for dynamic trees
cites work: On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
Wikidata QID: Q127720909
description: scientific article; zbMATH DE number 902876