Minimum k-partitioning of rectilinear polygons

DOI10.1016/S0747-7171(08)80022-3zbMath0698.68044OpenAlexW2091525714WikidataQ57603455 ScholiaQ57603455MaRDI QIDQ912618

Oliver Günther

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80022-3

zbMATH Keywords

rectilinear polygonk-partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other problems of combinatorial convexity (52A37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for minimum length partitions of polygons
• Efficient structures for geometric data management
• Triangulating a simple polygon
• Traditional Galleries Require Fewer Watchmen
• Decomposing a Polygon into Simpler Components
• Efficient Algorithms for Geometric Graph Search Problems
• Triangulation and shape-complexity
• Minimal rectangular partitions of digitized blobs
• Minimal Triangulations of Polygonal Domains
• Some NP-hard polygon decomposition problems
• Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
• Location of a Point in a Planar Subdivision and Its Applications
• Decomposition of Polygons into Convex Sets

This page was built for publication: Minimum k-partitioning of rectilinear polygons