Skip to main navigation Skip to search Skip to main content

A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles

  • Ambar Pal
  • , Rajiv Raman
  • , Saurabh Ray
  • , Karamjeet Singh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

For a hypergraph H = (X, έ) a support is a graph G on X such that for each E ∈ έ, the induced subgraph of G on the elements in E is connected. If G is planar, we call it a planar support. A set of axis parallel rectangles R forms a non-piercing family if for any R1, R2 ∈ R, R1 \ R2 is connected. Given a set P of n points in R2 and a set R of m non-piercing axis-aligned rectangles, we give an algorithm for computing a planar support for the hypergraph (P, R) in O(n log2 n + (n + m) log m) time, where each R ∈ R defines a hyperedge consisting of all points of P contained in R.

Original languageEnglish
Title of host publication35th International Symposium on Algorithms and Computation, ISAAC 2024
EditorsJulian Mestre, Anthony Wirth
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773546
DOIs
StatePublished - 4 Dec 2024
Externally publishedYes
Event35th International Symposium on Algorithms and Computation, ISAAC 2024 - Sydney, Australia
Duration: 8 Dec 202411 Dec 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume322
ISSN (Print)1868-8969

Conference

Conference35th International Symposium on Algorithms and Computation, ISAAC 2024
Country/TerritoryAustralia
CitySydney
Period8/12/2411/12/24

Keywords

  • Algorithms
  • Computational Geometry
  • Hypergraphs
  • Visualization

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'A Fast Algorithm for Computing a Planar Support for Non-Piercing Rectangles'. Together they form a unique fingerprint.

Cite this