Triangulating with high connectivity.
From MaRDI portal
Publication:2482884
DOI10.1016/S0925-7721(96)00003-XzbMATH Open1133.65302OpenAlexW2180942944MaRDI QIDQ2482884FDOQ2482884
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
Recommendations
Cites Work
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for drawing graphs: An annotated bibliography
- A theorem on graphs
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- On the complexity of locating linear facilities in the plane
- Hamiltonian cycles in planar triangulations with no separating triangles
- On the convex layers of a planar set
- Connectivity of plane triangulations
- 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)
