Triangulating with high connectivity.

DOI10.1016/S0925-7721(96)00003-XMaRDI QIDQ2482884zbMATH OpenOpenAlexFDO

Authors Michael B. Dillencourt, Subir Kumar Ghosh, Jason M. Cahill, Tamal K. 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

discrete geometrytriangulations\(k\)-connectedness

Mathematics Subject Classification ID

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

Recommendations

• Four-connected triangulations of planar point sets
• On triangulating planar graphs under the four-connectivity constraint
• Flip graphs of bounded degree triangulations
• On triangulating planar graphs under the four-connectivity constraint
• Connectivity of triangulation flip graphs in the plane

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• A theorem on graphs
• Algorithms for drawing graphs: An annotated bibliography
• Connectivity of plane triangulations
• Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
• Graph theory with applications
• Hamiltonian cycles in planar triangulations with no separating triangles
• On the complexity of locating linear facilities in the plane
• On the convex layers of a planar set
• Partitioning arrangements of lines. II: Applications

Cited in

(9)

• Four-connected triangulations of planar point sets
• Computational complexity of the vertex cover problem in the class of planar triangulations
• Cubic plane graphs on a given point set
• Which point sets admit a \(k\)-angulation?
• Geometric biplane graphs. II: Graph augmentation
• On triangulating planar graphs under the four-connectivity constraint
• Compatible triangulations and point partitions by series-triangular graphs
• Parity-constrained triangulations with Steiner points
• On triconnected and cubic plane graphs on given point sets

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

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