Triangulations, visibility graph and reflex vertices of a simple polygon

DOI10.1016/0925-7721(95)00027-5zbMATH Open0857.68106OpenAlexW2045911857MaRDI QIDQ1126249FDOQ1126249

Authors: Ferran Hurtado, Marc Noy 

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

Recommendations

• An optimal visibility graph algorithm for triangulated simple polygons
• Triangulating Simple Polygons and Equivalent Problems
• The art gallery theorem for simple polygons in terms of the number of reflex and convex vertices
• On the minimality of polygon triangulation
• scientific article; zbMATH DE number 1409186

zbMATH Keywords

triangulationvisibilityvisibility graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decomposing a Polygon into Simpler Components
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

Cited In (6)

• Bichromatic compatible matchings
• On the minimum size of visibility graphs
• A generalized Winternitz theorem
• Geodesic-preserving polygon simplification
• Ears of triangulations and Catalan numbers
• The Mathematics of Ferran Hurtado: A Brief Survey

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

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