scientific article; zbMATH DE number 4049401

zbMATH Open0643.90070MaRDI QIDQ3786288FDOQ3786288

Authors: Robin Liu, Simeon C. Ntafos 

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• On a partition into convex polygons
• Partitioning and separating sets of orthogonal polygons
• On partitioning rectilinear polygons into star-shaped polygons
• scientific article; zbMATH DE number 1159075
• On convex partitions of polygonal regions
• Rectangular partitions of a rectilinear polygon
• Polygonal partitions
• On \(d\)-convex partitions of polygonal regions
• Computing partitions of rectilinear polygons with minimum stabbing number
• Minimum k-partitioning of rectilinear polygons

zbMATH Keywords

computational geometrypartitioning a rectilinear polygon

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of partitions of integers (05A17)

Cited In (21)

• Minimum rectilinear polygons for given angle sequences
• Title not available (Why is that?)
• Storing line segments in partition trees
• On decomposing polygons into uniformly monotone parts
• Title not available (Why is that?)
• Good NEWS: partitioning a simple polygon by compass directions
• GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS
• Computational Science and Its Applications – ICCSA 2004
• The structure of optimal partitions of orthogonal polygons into fat rectangles
• Title not available (Why is that?)
• Partitioning and separating sets of orthogonal polygons
• Title not available (Why is that?)
• On \(d\)-convex partitions of polygonal regions
• Minimum k-partitioning of rectilinear polygons
• Title not available (Why is that?)
• Partitioning linear spaces into complete quadrilaterals and \(n\)-gons
• Linear-time heuristics for minimum weight rectangulation
• Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles
• On partitioning rectilinear polygons into star-shaped polygons
• Rectangular partition is polynomial in two dimensions but NP-complete in three
• Approximation algorithms for partitioning a rectangle with interior points

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786288)