scientific article; zbMATH DE number 7205030

DOI10.4230/LIPIcs.ESA.2017.52zbMath1442.68252MaRDI QIDQ5111741

Sasanka Roy, Haim Kaplan, Micha Sharir

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

areacomputational geometrygeometric optimizationperimeterrectangles

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area and volume in real or complex geometry (51M25)

Related Items (2)

Smallest \(k\)-enclosing rectangle revisited ⋮ Smallest k-enclosing rectangle revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Enclosing \(k\) points in the smallest axis parallel rectangle
• Selection in \(X+Y\) and matrices with sorted rows and columns
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Iterated nearest neighbors and finding minimal polytopes
• A unified algorithm for finding maximum and minimum object enclosing rectangles and cuboids
• Finding k points with minimum diameter and related problems
• Generalized Selection and Ranking: Sorted Matrices
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Finding kth paths and p-centers by generating and searching good data structures
• Static and Dynamic Algorithms for k-Point Clustering Problems
• Algorithmic discrepancy beyond partial coloring
• Covering many points with a small-area box

This page was built for publication: