Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation

DOI10.1016/j.ipl.2005.02.013zbMath1182.68331OpenAlexW2068466321MaRDI QIDQ1041762

Subhas C. Nandy, Partha P. Goswami, Sandip Das

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.013

zbMATH Keywords

optimizationcomputational geometrylevels of arrangementplane sweep

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Expected size of random Tukey layers and convex layers ⋮ Square and Rectangle Covering with Outliers ⋮ Optimizing Squares Covering a Set of Points ⋮ Covering points by disjoint boxes with outliers ⋮ Optimizing squares covering a set of points ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ Smallest \(k\)-enclosing rectangle revisited ⋮ Smallest k-enclosing rectangle revisited ⋮ SMALLEST COLOR-SPANNING OBJECT REVISITED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enclosing \(k\) points in the smallest axis parallel rectangle
• Iterated nearest neighbors and finding minimal polytopes
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• On geometric optimization with few violated constraints
• On the computational power of pushdown automata
• Finding k points with minimum diameter and related problems
• Printer graphics for clustering
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Static and Dynamic Algorithms for k-Point Clustering Problems

This page was built for publication: Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation