scientific article

zbMath0971.68625MaRDI QIDQ2728846

Prosenjit Bose, Anil Maheshwari, Jurek Czyzowicz, Danny Krizanc, Evangelos Kranakis

Publication date: 1 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmconvex polygonorthogonal polygonssimple polygonpolygon cuttingshortest chord

Mathematics Subject Classification ID

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

Related Items (6)

A survey of mass partitions ⋮ Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ Vertex Fault-Tolerant Geometric Spanners for Weighted Points ⋮ Spanners for geodesic graphs and visibility graphs ⋮ Cutting polygons into small pieces with chords: Laser-based localization ⋮ Vertex fault-tolerant spanners for weighted points in polygonal domains

This page was built for publication: