An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles

Authors:
Panagiotis D. Alevizos
Affiliations:
Department of Mathematics, University of Patras, GR-265 00 Patras, Greece
Venue:
Information Processing Letters
Year:
2013

Citing 8
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Principles of interactive computer graphics (2nd ed.)

Principles of interactive computer graphics (2nd ed.)
Time- and space-optimal contour computation for a set of rectangles

Information Processing Letters
Computer graphics: principles and practice (2nd ed.)

Computer graphics: principles and practice (2nd ed.)
Introduction to VLSI Systems

Introduction to VLSI Systems
An optimal algorithm for testing for safety and detecting deadlocks in locked transaction systems

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

IEEE Transactions on Computers
Locking policies: Safety and freedom from deadlock

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Given n rectangles R"1,...,R"n on the plane with sides parallel to the coordinate axes, Lipski and Preparata (1981) [1] have presented a @Q(nlogn) time and O(nlogn) space algorithm for computing the non-trivial circuits of the union U=R"1@?...@?R"n. In this paper, we are presenting a simple algorithm, which computes the non-trivial circuits of U in @Q(nlogn) time and @Q(n) space.