Faster algorithms for growing prioritized disks and rectangles
type: Item
instance of: scholarly article
title: Faster algorithms for growing prioritized disks and rectangles
zbMATH Open document ID: 1456.68219
author: Hee-Kap Ahn
author: Sang Won Bae
author: Matias Korman
author: Wolfgang Mulzer
author: Eunjin Oh
author: André van Renssen
author: Antoine Vigneron
author: Jong Min Choi
author: Ji-won Park
published in: Computational Geometry
publication date: 2019-10-18T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8219/
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7119675
zbMATH Keywords: elimination order
zbMATH Keywords: quadtree
zbMATH Keywords: condition number
zbMATH Keywords: lower bound
zbMATH Keywords: data structures
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2608045512
cites work: Computing Envelopes in Four Dimensions with Applications
cites work: Growing balls in \(\mathbb{R}^d\)
cites work: Computational geometry. Algorithms and applications.
cites work: Preprocessing imprecise points for Delaunay triangulation: simplified and extended
cites work: Agglomerative clustering of growing squares
cites work: Q4515159
cites work: Ray shooting in polygons using geodesic triangulations
cites work: A singly exponential stratification scheme for real semi-algebraic varieties and its applications
cites work: Q4281527
cites work: Crushing disks efficiently
cites work: Parametrized runtimes for label tournaments
cites work: Geometric approximation algorithms
cites work: Finding the upper envelope of n line segments in O(n log n) time
cites work: Almost tight upper bounds for vertical decompositions in four dimensions
cites work: Q4530626
cites work: Efficient Point Location in a Convex Spatial Cell-Complex
cites work: Q4325546
Wikidata QID: Q128363237
DOI: 10.1016/J.COMGEO.2019.02.001
Recommended article: Q5136216
Recommended article: Faster algorithms for largest empty rectangles and boxes
Recommended article: Q4250223
Recommended article: Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
Recommended article: A fast deterministic smallest enclosing disk approximation algorithm
Recommended article: Algorithms - ESA 2003
Recommended article: Faster Algorithms for Incremental Topological Ordering
Recommended article: QuickhullDisk: a faster convex hull algorithm for disks
Recommended article: Efficient algorithms for the largest rectangle problem
Recommended article: Faster algorithms for stable allocation problems
description: scientific article; zbMATH DE number 7119675