Uniformly monotone partitioning of polygons
From MaRDI portal
Publication:6593668
DOI10.1016/J.TCS.2024.114724MaRDI QIDQ6593668FDOQ6593668
Authors: Hwi Kim, Jaegun Lee, Hee-Kap Ahn 
Publication date: 27 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Doubly lexical ordering of dense 0--1 matrices
- Triangulating a simple polygon in linear time
- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
- Location of a Point in a Planar Subdivision and Its Applications
- Optimal shortest path queries in a simple polygon
- Ray shooting in polygons using geodesic triangulations
- Title not available (Why is that?)
- Decomposing a Polygon into Simpler Components
- Title not available (Why is that?)
- On decomposing polygons into uniformly monotone parts
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)
