Triangulations, visibility graph and reflex vertices of a simple polygon

DOI10.1016/0925-7721(95)00027-5zbMath0857.68106OpenAlexW2045911857MaRDI QIDQ1126249

Marc Noy, Ferran Hurtado

Publication date: 8 December 1996

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00027-5

zbMATH Keywords

triangulationvisibilityvisibility graph

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

Ears of triangulations and Catalan numbers ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ A generalized Winternitz theorem ⋮ GEODESIC-PRESERVING POLYGON SIMPLIFICATION ⋮ On the minimum size of visibility graphs ⋮ Bichromatic compatible matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• Decomposing a Polygon into Simpler Components

This page was built for publication: Triangulations, visibility graph and reflex vertices of a simple polygon