On some union and intersection problems for polygons with fixed orientations
type: Item
instance of: scholarly article
title: On some union and intersection problems for polygons with fixed orientations
zbMATH Open document ID: 0579.68044
DOI: 10.1007/BF02240065
author: B. George
published in: Computing
publication date: 1986-01-01T00:00:00Z
review text: See the preview in Zbl 0571.68050.
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 51M20
zbMATH DE Number: 3928363
zbMATH Keywords: decomposition of a set of polygons
zbMATH Keywords: computational geometry
zbMATH Keywords: VLSI
zbMATH Keywords: design
zbMATH Keywords: connected components
zbMATH Keywords: intersecting polygons
zbMATH Keywords: optimal
zbMATH Keywords: algorithms
MaRDI profile type: Publication
cites work: Q4091421
cites work: Dynamic C-oriented polygonal intersection searching
cites work: Q3670558
cites work: Plane-sweep algorithms for intersecting geometric figures
cites work: Q3727415
cites work: Rectilinear line segment intersection, layered segment trees, and dynamization
cites work: The measure problem for rectangular ranges in d-space
description: scientific article; zbMATH DE number 3928363