Triangulating with high connectivity.

DOI10.1016/S0925-7721(96)00003-XzbMath1133.65302OpenAlexW2180942944MaRDI QIDQ2482884

Jason M. Cahill, Michael B. Dillencourt, Subir Kumar Ghosh, Tamal Krishna Dey

Publication date: 25 April 2008

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(96)00003-x

zbMATH Keywords

triangulationsdiscrete geometry\(k\)-connectedness

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of plane triangulations
• Partitioning arrangements of lines. II: Applications
• Algorithms for drawing graphs: An annotated bibliography
• A theorem on graphs
• On the complexity of locating linear facilities in the plane
• On the convex layers of a planar set
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Hamiltonian cycles in planar triangulations with no separating triangles

Related Items (7)

On triconnected and cubic plane graphs on given point sets ⋮ Cubic plane graphs on a given point set ⋮ Parity-constrained triangulations with Steiner points ⋮ Computational complexity of the vertex cover problem in the class of planar triangulations ⋮ Compatible triangulations and point partitions by series-triangular graphs ⋮ Geometric biplane graphs. II: Graph augmentation ⋮ Four-connected triangulations of planar point sets

This page was built for publication: Triangulating with high connectivity.