An optimal algorithm for reporting visible rectangles
type: Item
instance of: scholarly article
title: An optimal algorithm for reporting visible rectangles
zbMATH Open document ID: 1051.68133
DOI: 10.1016/S0020-0190(01)00228-9
published in: Information Processing Letters
publication date: 2003-06-24T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1835261
author: Nectarios Kitsios
MaRDI profile type: Publication
cites work: Hidden surface removal for rectangles
cites work: Output-sensitive methods for rectilinear hidden surface removal
cites work: THE OBJECT COMPLEXITY MODEL FOR HIDDEN-SURFACE REMOVAL
cites work: New algorithms for special cases of the hidden line elimination problem
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
cites work: Efficient hidden surface removal for objects with small union size
cites work: Space-optimal hidden line elimination for rectangles
cites work: Hidden line elimination for isooriented rectangles
cites work: Fat Triangles Determine Linearly Many Holes
cites work: Dynamic partition trees
cites work: A simple output-sensitive algorithm for hidden surface removal
full work available at URL: s0020-0190(01)00228-9
OpenAlex ID: W2004595913
description: scientific article; zbMATH DE number 1835261