Triangulating with high connectivity
Tamal K. Dey, Michael B. Dillencourt, Subir Ghosh et al. · Computational Geometry · 1997
Cited by 46 works. doi:10.1016/s0925-7721(96)00003-x Open-access PDF
Authors
References
- 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
- Partitioning arrangements of lines II: Applications
- Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
- Hamiltonian cycles in planar triangulations with no separating triangles
- Connectivity of plane triangulations