Four-connected triangulations of planar point sets

DOI10.1007/s00454-015-9694-xzbMath1325.68249arXiv1310.1726OpenAlexW1965875121MaRDI QIDQ2351013

Bodhayan Roy, Subir Kumar Ghosh, Ajit A. Diwan

Publication date: 26 June 2015

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.1726

zbMATH Keywords

triangulationmatchingconvex hullannular region4-connectedgood setcomplex triangleforbidden triangleinward triangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Geometric biplane graphs. II: Graph augmentation ⋮ Four-connected triangulations of planar point sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On triconnected and cubic plane graphs on given point sets
• Connectivity of plane triangulations
• Four-connected triangulations of planar point sets
• Triangulating with high connectivity.
• Plane Geometric Graph Augmentation: A Generic Perspective
• On the convex layers of a planar set

This page was built for publication: Four-connected triangulations of planar point sets