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

DOI10.1016/J.IPL.2012.11.002zbMath1259.68208OpenAlexW2077811577MaRDI QIDQ1943607

Panagiotis D. Alevizos

Publication date: 20 March 2013

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

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

zbMATH Keywords

contourcircuitoptimal algorithmcomputational geometrysweep planerectilinear polygons

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems

This page was built for publication: An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles