Uniformly monotone partitioning of polygons

DOI10.1016/J.TCS.2024.114724MaRDI QIDQ6593668zbMATH OpenFDO

Authors Hwi Kim, Jaegun Lee, Hee-Kap Ahn

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

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3986641 (Why is no real title available?)
• scientific article; zbMATH DE number 1424299 (Why is no real title available?)
• Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
• Computational geometry. Algorithms and applications.
• Decomposing a Polygon into Simpler Components
• Doubly lexical ordering of dense 0--1 matrices
• Location of a Point in a Planar Subdivision and Its Applications
• On decomposing polygons into uniformly monotone parts
• Optimal shortest path queries in a simple polygon
• Ray shooting in polygons using geodesic triangulations
• Triangulating a simple polygon in linear time

Cited in

(1)

• Monotone partitions of simple polygons

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

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