Uniformly monotone partitioning of polygons

DOI10.1016/j.tcs.2024.114724MaRDI QIDQ6593668

Jaegun Lee, Hee-Kap Ahn, Hwi Kim

Publication date: 27 August 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

simple polygonmonotone partitionminimum partition

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On decomposing polygons into uniformly monotone parts
• Triangulating a simple polygon in linear time
• Ray shooting in polygons using geodesic triangulations
• Optimal shortest path queries in a simple polygon
• Doubly lexical ordering of dense 0--1 matrices
• Decomposing a Polygon into Simpler Components
• Location of a Point in a Planar Subdivision and Its Applications
• Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs

This page was built for publication: Uniformly monotone partitioning of polygons