Connected Rectilinear Graphs on Point Sets
From MaRDI portal
Recommendations
- Connected rectilinear graphs on point sets
- scientific article; zbMATH DE number 219276
- ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
- On the connectedness of some geometric graphs
- On finding non-intersecting straightline connections of grid points to the boundary
Cites work
- Angle-restricted tours in the plane.
- Connected Rectilinear Graphs on Point Sets
- Embedding rectilinear graphs in linear time
- Graph Drawing
- How good is the information theory bound in sorting?
- scientific article; zbMATH DE number 4062601 (Why is no real title available?)
- On the computational complexity of upward and rectilinear planarity testing
- Rectilinear Graphs and Their Embeddings
- The complexity of detecting crossingfree configurations in the plane
- Topologically sweeping an arrangement
Cited in
(10)- Covering points with minimum/maximum area orthogonally convex polygons
- Connected rectilinear graphs on point sets
- scientific article; zbMATH DE number 3845614 (Why is no real title available?)
- scientific article; zbMATH DE number 5764872 (Why is no real title available?)
- Connected Rectilinear Graphs on Point Sets
- On finding non-intersecting straightline connections of grid points to the boundary
- Covering points with orthogonal polygons
- Covering points with orthogonally convex polygons
- On the connectivity of the disjointness graph of segments of point sets in general position in the plane
- Reconstructing orthogonal polyhedra from putative vertex sets
This page was built for publication: Connected Rectilinear Graphs on Point Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611865)