Polygon cutting: Revisited

DOI10.1007/978-3-540-46515-7_7MaRDI QIDQ2728846zbMATH OpenFDO

Authors Prosenjit Bose, Jurek Czyzowicz, Anil Maheshwari, Evangelos Kranakis, D. Krizanc

Publication date 1 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-46515-7_7

zbMATH Keywords

algorithmconvex polygonorthogonal polygonspolygon cuttingshortest chordsimple polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Recommendations

• Algorithms for fair partitioning of convex polygons
• Algorithms for fair partitioning of convex polygons
• Algorithms for minimum length partitions of polygons
• On the Optimal Bisection of a Polygon
• Bisections and ham-sandwich cuts of convex polygons and polyhedra

Cited in

(15)

• A PTAS for cutting out polygons with lines
• Spanners for geodesic graphs and visibility graphs
• Applications of cut polyhedra. II
• CUTTING OUT POLYGONS WITH A CIRCULAR SAW
• On the Optimal Bisection of a Polygon
• Lifting and separation procedures for the cut polytope
• Cutting Polyominos into Equal-Area Triangles
• scientific article; zbMATH DE number 1979490 (Why is no real title available?)
• A survey of mass partitions
• Peeling potatoes near-optimally in near-linear time
• Cutting polygons into small pieces with chords: Laser-based localization
• Vertex Fault-Tolerant Geometric Spanners for Weighted Points
• Vertex fault-tolerant spanners for weighted points in polygonal domains
• Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines
• A divide-and-conquer based preprocessing for routing in a simple polygon

This page was built for publication: Polygon cutting: Revisited

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