Faster algorithms for growing prioritized disks and rectangles

DOI10.1016/J.COMGEO.2019.02.001zbMATH Open1456.68219OpenAlexW2608045512WikidataQ128363237 ScholiaQ128363237MaRDI QIDQ2330036FDOQ2330036

Authors: Hee-Kap Ahn, Sang Won Bae, Matias Korman, Wolfgang Mulzer, Eunjin Oh, André van Renssen, Antoine Vigneron, Jong Min Choi, Ji-won Park 

Publication date: 18 October 2019

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8219/

Recommendations

• scientific article; zbMATH DE number 7278008
• Faster algorithms for largest empty rectangles and boxes
• scientific article; zbMATH DE number 1303597
• Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
• A fast deterministic smallest enclosing disk approximation algorithm
• Algorithms - ESA 2003
• Faster Algorithms for Incremental Topological Ordering
• QuickhullDisk: a faster convex hull algorithm for disks
• Efficient algorithms for the largest rectangle problem
• Faster algorithms for stable allocation problems

zbMATH Keywords

quadtreedata structurescondition numberlower boundelimination order

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Analysis of algorithms (68W40) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational geometry. Algorithms and applications.
• Efficient Point Location in a Convex Spatial Cell-Complex
• Geometric approximation algorithms
• Finding the upper envelope of n line segments in O(n log n) time
• Title not available (Why is that?)
• Computing Envelopes in Four Dimensions with Applications
• Ray shooting in polygons using geodesic triangulations
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• A singly exponential stratification scheme for real semi-algebraic varieties and its applications
• Almost tight upper bounds for vertical decompositions in four dimensions
• Growing balls in \(\mathbb{R}^d\)
• Parametrized runtimes for label tournaments
• Crushing disks efficiently
• Title not available (Why is that?)
• Agglomerative clustering of growing squares

Cited In (5)

• Agglomerative clustering of growing squares
• Title not available (Why is that?)
• Parametrized runtimes for label tournaments
• Growing balls in \(\mathbb{R}^d\)
• Crushing disks efficiently

This page was built for publication: Faster algorithms for growing prioritized disks and rectangles

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