GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA

DOI10.1142/S0218195905001877zbMath1088.65013WikidataQ59411183 ScholiaQ59411183MaRDI QIDQ3373056

Prosenjit Bose, Marc J. van Kreveld

Publication date: 13 March 2006

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

monotonicitypolyhedradualitypolygonrecognition algorithmplane sweep

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment ⋮ Line-of-Sight Pursuit in Monotone and Scallop Polygons ⋮ Covering a simple polygon by monotone directions ⋮ Rotationally monotone polygons ⋮ Clamshell casting

Cites Work

• Unnamed Item
• Walking an unknown street with bounded detour
• Moldable and castable polygons
• Filling polyhedral molds.
• On a class of \(O(n^ 2)\) problems in computational geometry
• Morse Theory. (AM-51)
• THE TWO GUARDS PROBLEM
• Faster shortest-path algorithms for planar graphs

This page was built for publication: GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA