An upper bound on the number of rectangulations of a point set

Eyal Ackerman, Gill Barequet, Ron Y. Pinter

Research output: Contribution to journalConference articlepeer-review

Abstract

We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments, such that every point is on a segment. Using a novel counting technique of Santos and Seidel [12], we show an upper bound of O(20n/n4) on this number.

Original languageEnglish
Pages (from-to)554-559
Number of pages6
JournalLecture Notes in Computer Science
Volume3595
DOIs
StatePublished - 2005
Externally publishedYes
Event11th Annual International Conference on Computing and Combinatorics, COCOON 2005 - Kunming, China
Duration: 16 Aug 200529 Aug 2005

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'An upper bound on the number of rectangulations of a point set'. Together they form a unique fingerprint.

Cite this